213 search results - page 4 / 43 » Semidefinite programming |
121
Voted
SIAMJO
2002
14 years 12 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...
79
Voted
SIAMJO
2008
15 years 4 days 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 ...
100
Voted
SIAMJO
2008
15 years 4 days 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 ...
114
Voted
NIPS
2004
15 years 1 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...
110
Voted
MP
2010
14 years 7 months ago
2010
Let S = {x Rn : g1(x) 0,