Related references
Note: Only part of the references are listed.A convex polynomial that is not sos-convex
Amir Ali Ahmadi et al.
MATHEMATICAL PROGRAMMING (2012)
Certificates of convexity for basic semi-algebraic sets
J. B. Lasserre
APPLIED MATHEMATICS LETTERS (2010)
Semidefinite representation of convex sets
J. William Helton et al.
MATHEMATICAL PROGRAMMING (2010)
CONVEXITY IN SEMIALGEBRAIC GEOMETRY AND POLYNOMIAL OPTIMIZATION
Jean B. Lasserre
SIAM JOURNAL ON OPTIMIZATION (2009)
BIQUADRATIC OPTIMIZATION OVER UNIT SPHERES AND SEMIDEFINITE PROGRAMMING RELAXATIONS
Chen Ling et al.
SIAM JOURNAL ON OPTIMIZATION (2009)
A Positive Definite Polynomial Hessian that Does not Factor
Amir Ali Ahmadi et al.
PROCEEDINGS OF THE 48TH IEEE CONFERENCE ON DECISION AND CONTROL, 2009 HELD JOINTLY WITH THE 2009 28TH CHINESE CONTROL CONFERENCE (CDC/CCC 2009) (2009)
Representation of nonnegative convex polynomials
Jean B. Lasserre
ARCHIV DER MATHEMATIK (2008)
Establishing Convexity of Polynomial Lyapunov Functions and Their Sublevel Sets
G. Chesi et al.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2008)
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Etienne de Klerk
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH (2008)
Distinguishing separable and entangled states
AC Doherty et al.
PHYSICAL REVIEW LETTERS (2002)
A survey of computational complexity results in systems and control
VD Blondel et al.
AUTOMATICA (2000)