Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
Year of publication: |
2014
|
---|---|
Authors: | Jeyakumar, Vaithilingam ; Phạm, T. S. ; Li, Guoyin |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 42.2014, 1, p. 34-40
|
Subject: | Convex polynomial optimization | Sums-of-squares of polynomials | Semidefinite programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Inverse polynomial optimization
Lasserre, Jean-Bernard, (2013)
-
Computational results of a semidefinite branch-and-bound algorithm for k-cluster
Krislock, Nathan, (2016)
-
K-optimal design via semidefinite programming and entropy optimization
Maréchal, Pierre, (2015)
- More ...
-
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs
Jeyakumar, Vaithilingam, (2015)
-
Exact SDP relaxation for classes of nonlinear semidefinite programming problems
Jeyakumar, Vaithilingam, (2012)
-
Strong duality for robust minimax fractional programming problems
Jeyakumar, Vaithilingam, (2013)
- More ...