Semidefinite Programming Relaxation vs Polyhedral Homotopy ...
Semidefinite Programming Relaxation vs Polyhedral Homotopy ...
Semidefinite Programming Relaxation vs Polyhedral Homotopy ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Sparse (SDP) relaxation = Lasserre (2001) + c-sparsityPOP min. f 0 (x) s.t. f j (x) ≥ 0 or = 0 (j = 1,...,m), c-sparse.⇓A sequence of c-sparse SDP relaxation problems dependingon the relaxation order r= 1, 2,...;Workshop on Advances in Optimization, April 19-21, 2007 – p.9/24