Convex sets with semidefinite representation

Mathematical Programming

Volumn 120, Issue 2, 2009, Pages 457-477

  Lasserre, Jean B ^a  

^a LAAS CNRS   (France)

Author keywords

Convex sets; Representation of positive polynomials; Semidefinite representation; Sum of squares

Indexed keywords

CONVEX HULLS; CONVEX SETS; LAGRANGIAN; REPRESENTATION OF POSITIVE POLYNOMIALS; SEMI-ALGEBRAIC SETS; SEMIDEFINITE REPRESENTATION; SUFFICIENT CONDITIONS; SUM OF SQUARES; UNIT BALLS;

POLYNOMIAL APPROXIMATION; SODIUM COMPOUNDS;

SET THEORY;

EID: 67349207086     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-008-0222-0     Document Type: Article

References (21)

1. F. Alizadeh J-P. Haeberly M. Overton 1997 Complementarity and nondegeneracy in semidefinite programming Math. Program 77 111 128 (Pubitemid 127412627)
2. Ben-Tal A., Nemirovski A.: Lectures on modern convex optimization. SIAM, Philadelphia (2001)
3. C. Beng Chua L. Tuncel 2008 Invariance and efficiency of convex representations Math. Program 111 113 140 (Pubitemid 46993957)
4. Helton, J.W., Vinnikov, V.: Linear matrix inequality representation of sets. Comm. Pure Appl. Math. (to appear). arXiv:math.OC/0306180
5. Helton, J.W., Nie, J.: Semidefinite representation of convex sets, Technical report, Mathematics Dept., University of California at San Diego, USA, 2007. arXiv:0705.4068
6. Hiriart-Urruty J-B., Lemarechal C.: Convex analysis and minimization algorithms I. Springer, Berlin (1993)
7. T. Jacobi A. Prestel 2001 Distinguished representations of strictly positive polynomials J. Reine. Angew. Math. 532 223 235 (Pubitemid 33402975)
8. Laraki, R., Lasserre, J.B.: Computing uniform convex approximations for convex envelopes and convex hulls, J. Convex. Anal. 15, (2008)
9. J.B. Lasserre 2001 Global optimization with polynomials and the problem of moments SIAM J. Optim. 11 796 817 (Pubitemid 33573032)
10. J.B. Lasserre 2002 An explicit equivalent positive semidefinite program for nonlinear 0-1 programs SIAM J. Optim. 12 756 769 (Pubitemid 135744796)
11. J.B. Lasserre T. Netzer 2006 SOS approximation of nonnegative polynomial via simple high degree perturbations Math. Z. 256 99 112
12. Lasserre, J.B.: Conditions for a real polynomial to be sum of squares. Arch. der. Math. 89, 390-398 (2007). doi: 10.1007/s00013-007-2251-y. Available at http://arxiv.org/abs/math.AG/0612358
13. A.S. Lewis P. Parrilo M.V. Ramana 2005 The Lax conjecture is true Proc. Am. Math. Soc. 133 2495 2499 (Pubitemid 41328379)
14. J. Nie M. Schweighofer 2007 On the complexity of Putinar's Positivstellensatz J. Complexity. 23 135 150 (Pubitemid 46217139)
15. Parrilo, P.: Exact semidefinite representations for genus zero curves, Talk at the Banff workshop "Positive Polynomials and Optimization", Banff, Canada, October 8-12 (2006)
16. G. Pataki L. Tuncel 2001 On the generic properties of convex optimization problems in conic form Math. Program. 89 449 457 (Pubitemid 33758492)
17. M. Putinar 1993 Positive polynomials on compact semi-algebraic sets Indiana Univ. Math. J. 42 969 984
18. K. Schmüdgen 1991 The K-moment problem for compact semi-algebraic sets Math. Ann. 289 203 206
19. M. Schweighofer 2004 On the complexity of Schmüdgen's Positivstellensatz J. Complexity. 20 529 543 (Pubitemid 38956021)
20. L. Vandenberghe S. Boyd 1996 Semidefinite programming SIAM Rev. 38 49 95 (Pubitemid 126610912)
21. Y. Ye S. Zhang 2003 New results on quadratic minimization SIAM J. Optim. 14 245 267 (Pubitemid 38318152)