Sciweavers

SIAMJO
2008
66views more  SIAMJO 2008»
13 years 10 months ago
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
Zizhuo Wang, Song Zheng, Yinyu Ye, Stephen Boyd
MP
2008
81views more  MP 2008»
13 years 11 months ago
An inexact primal-dual path following algorithm for convex quadratic SDP
Abstract We propose primal-dual path-following Mehrotra-type predictorcorrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{1 2 ...
Kim-Chuan Toh
JSAT
2006
114views more  JSAT 2006»
13 years 11 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos