213 search results - page 4 / 43 » Semidefinite programming |
SIAMJO
2002
13 years 8 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
2008
13 years 8 months ago
2008
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
SIAMJO
2008
13 years 8 months ago
2008
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
NIPS
2004
13 years 10 months ago
2004
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
MP
2010
13 years 3 months ago
2010
Let S = {x Rn : g1(x) 0,