Sufficient and necessary conditions for semidefinite representability of convex hulls and sets

SIAM Journal on Optimization

Volumn 20, Issue 2, 2009, Pages 759-791

  Helton, J William ^a   Nie, Jiawang ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

(Strictly) quasi concavity; Convex hull; Convex set; Irredundancy; Linear matrix inequality; Nonsingularity; Positive curvature; Semialgebraic set; Semidefinite programming; Semidefinite representation; Singularity; Smoothness; Sos concavity; Sum of squares

Indexed keywords

CONVEX HULL; CONVEX SET; NONSINGULARITY; SEMI-DEFINITE PROGRAMMING; SUM OF SQUARES;

COMPUTATIONAL GEOMETRY; LINEAR MATRIX INEQUALITIES; MATHEMATICAL PROGRAMMING; POLYNOMIALS; TRAJECTORIES;

SET THEORY;

EID: 70450210254     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/07070526X     Document Type: Article

References (15)

1. A. BEN-TAL AND A. NEMIROVSKI, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, MPS-SIAM Ser. Optim., SIAM, Philadelphia, 2001.
2. S. BOYD AND L. VANDENBERGHE, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004.
3. J. BOCHNAK, M. COSTE, AND M-F. ROY, Real Algebraic Geometry, Springer-Verlag, Berlin, 1998.
4. D. COX, J. LITTLE, AND D. O'SHEA, Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3rd ed. Undergrad. Texts Math., Springer, New York, 2007.
5. M. GHOMI, Optimal smoothing for convex polytopes, Bull. London Math. Soc., 36 (2004), pp. 483-492.
6. J. W. HELTON AND J. NIE, Semidefinite representation of convex sets, Math. Programming, to appear.
7. J. W. HELTON AND J. NIE, STRUCTURED SEMIDEFINITE REPRESENTATION OF SOME CONVEX SETS, Proceedings of the 47th IEEE Conference on Decision and Control, Cancun, Mexico, 2008, pp. 4797-4800.
8. J. W. HELTON AND V. VINNIKOV, Linear matrix inequality representation of sets, Comm. Pure Appl. Math., 60 (2007), pp. 654-674.
9. J. LASSERRE, Convex sets with semidefinite representation, Math. Program. Ser. A., 120 (2009), pp. 457-477.
10. Y. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
11. A. NEMIROVSKII, Advances in convex optimization: Conic programming, Plenary Lecture, International Congress of Mathematicians (ICM), Madrid, Spain, 2006, Eur. Math. Soc., Zürich, 2007, pp. 413-444.
12. P. PARRILO, Exact Semidefinite Representation for Genus Zero Curves, Talk at the Banff workshop "Positive Polynomials and Optimization," Banff, Canada, 2006.
13. R. T. ROCKAFELLAR, Convex Analysis, Princeton Landmarks Math., Princeton University Press, Princeton, NJ, 1997.
14. M. SPIVAK, A Comprehensive Introduction to Differential Geometry, Vol. II, 2nd ed., Publish or Perish, Inc., Wilmington, DE, 1979.
15. H. WOLKOWICZ, R. SAIGAL, AND L. VANDENBERGHE, EDS., Handbook of Semidefinite Programming, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.