Semidefinite representation of convex sets

Mathematical Programming

Volumn 122, Issue 1, 2010, Pages 21-64

  Helton, J William ^a   Nie, Jiawang ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Convex polynomials positive curvature; Convex sets; Linear matrix inequality (LMI); Modified Hessian; Moments; Schm dgen and Putinar's matrix Positivstellensatz; Semialgebraic geometry; Semidefinite programming (SDP); Sum of squares(SOS)

Indexed keywords

CONVEX POLYNOMIALS POSITIVE CURVATURE; CONVEX SETS; LINEAR MATRIX INEQUALITY (LMI); MODIFIED HESSIAN; MOMENTS; SEMIALGEBRAIC GEOMETRY; SEMIDEFINITE PROGRAMMING (SDP); SUM OF SQUARES(SOS);

DELAY CONTROL SYSTEMS; FUZZY CONTROL; LAGRANGE MULTIPLIERS; LINEAR CONTROL SYSTEMS; LINEAR MATRIX INEQUALITIES; MATHEMATICAL PROGRAMMING; POLYNOMIALS; UNCERTAIN SYSTEMS;

SET THEORY;

EID: 68449087853     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-008-0240-y     Document Type: Article

References (27)

1. Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2001)
2. Bochnak J., Coste M., Roy M.-F.: Real Algebraic Geometry. Springer, Heidelberg (1998)
3. Boyd S., Vandenberghe L.: Convex Optimization. Cambridge University Press, London (2004)
4. Conway J.B.: A course in functional analysis Graduate Texts in Math Series. Springer, Heidelberg (1985)
5. V.G. Dmitriev 1978 Submanifolds with everywhere semidefinite second fundamental form J. Math. Sci. 10 3 448 450
6. Hazewinkel, M.: Encyclopedia of Mathematics. Springer, Heidelberg. http://eom.springer.de/f/f042200.htm
7. Helton, J.W., Nie, J.: Sufficient and necessary conditions for semidefinite representability of convex hulls and Sets. SIAM J. Optim. (2007, submitted). http://arxiv.org/abs/0709.4017
8. Helton, J.W., Nie, J.: Structured semidefinite representation of some convex sets. In: Proceedings of 47th IEEE Conference on Decision and Control (CDC) (2008, in press). http://arXiv.org/abs/0802.1766
9. W. Helton V. Vinnikov 2007 Linear matrix inequality representation of sets Commun. Pure Appl. Math. 60 5 654 674
10. D. Henrion J. Lasserre 2003 GloptiPoly: global optimization over polynomials with Matlab and SeDuMi ACM Trans. Math. Soft. 29 165 194 (Pubitemid 40001449)
11. Hirsch M.W.: Differential topology. Graduate Texts in Mathematics, vol. 33. Springer, Heidelberg (1997)
12. Lasserre, J.: Convex sets with lifted semidefinite representation. LAAS. Math. Prog (to appear) (2006, preprint)
13. Marshall, M.: Representation of non-negative polynomials, degree bounds and applications to optimization. Can. J. Math. (2008, in press). http://math.usask.ca/~marshall/
14. Nesterov, Y., Nemirovski, A.: Interior-point polynomial algorithms in convex programming. In: SIAM Studies in Applied Mathematics, vol.13. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1994)
15. Nemirovski, A.: Advances in convex optimization: conic programming. Plenary Lecture, International Congress of Mathematicians (ICM), Madrid, Spain (2006)
16. J. Nie M. Schweighofer 2007 On the complexity of putinar's positivstellensatz J Complex. 23 135 150
17. Parrilo, P.: Exact semidefinite representation for genus zero curves. Talk at the Banff workshop "Positive Polynomials and Optimization", Banff, Canada, October 8-12, 2006
18. Parrilo, P., Sturmfels, B.: Minimizing polynomial functions, In: Basu, S., Gonzalez-Vega, L. (eds.) Proceedings of the DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science (March 2001), pp.83-100. American Mathematical Society, New York (2003)
19. Prajna, S., Papachristodoulou, A., Seiler, P., Parrilo, P.: SOSTOOLS user's guide. http://www.mit.edu/~parrilo/SOSTOOLS/
20. M. Putinar 1993 Positive polynomials on compact semi-algebraic sets Ind. Univ. Math. J. 42 203 206
21. Reznick, B.: Some concrete aspects of Hilbert's 17th problem. In: Contemporary Mathematics, vol. 253, pp. 251-272. American Mathematical Society, New York (2000)
22. C. Scherer C. Hol 2006 Matrix sum-of-squares relaxations for robust semi-definite programs Math. Prog. Ser. B 107 1-2 189 211
23. M. Schweighofer 2004 On the complexity of Schmüdgen's Positivstellensatz J. Complex. 20 4 529 543
24. C. Scheiderer 2003 Sums of squares on real algebraic curves Math. Z. 245 725 760
25. C. Scheiderer 2005 Distinguished representations of non-negative polynomials J. Algebra 289 558 573
26. K. Schmüdgen 1991 The K-moment problem for compact semialgebraic sets Math. Ann. 289 203 206
27. Wolkowicz, H., Saigal, R.,Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer, Dordrecht (2000)