45 search results - page 1 / 9 » Semidefinite Programs: New Search Directions, Smoothing-Type... |
SIAMJO
2002
13 years 4 months ago
2002
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Ex...
SIAMJO
2002
13 years 4 months ago
2002
This paper proposes a new predictor-corrector interior-point method for a class of semidefinite programs, which numerically traces the central trajectory in a space of Lagrange mul...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...