Semidefinite representation of convex sets
Top Cited Papers
- 21 August 2008
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 122 (1) , 21-64
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to OptimizationCanadian Journal of Mathematics, 2009
- On the complexity of Putinar's PositivstellensatzJournal of Complexity, 2007
- Linear matrix inequality representation of setsCommunications on Pure and Applied Mathematics, 2006
- Matrix Sum-of-Squares Relaxations for Robust Semi-Definite ProgramsMathematical Programming, 2005
- Distinguished representations of non-negative polynomialsJournal of Algebra, 2005
- On the complexity of Schmüdgen's PositivstellensatzJournal of Complexity, 2004
- GloptiPolyACM Transactions on Mathematical Software, 2003
- Some concrete aspects of Hilbert’s 17th Problem2000
- TheK-moment problem for compact semi-algebraic setsMathematische Annalen, 1991
- Submanifolds with everywhere semidefinite second fundamental formJournal of Mathematical Sciences, 1978