24 search results - page 2 / 5 » Lagrangian Dual Interior-Point Methods for Semidefinite Prog... |
STOC
2007
ACM
14 years 4 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
SIAMJO
2002
13 years 4 months ago
2002
In this paper we propose a novel finite-horizon, discrete-time, time-varying filtering method based on the robust semidefinite programming (SDP) technique. The proposed method prov...
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
SIAMJO
2008
13 years 4 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 ...
MP
2002
13 years 4 months ago
2002
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...