Related references
Note: Only part of the references are listed.Representation of nonnegative convex polynomials
Jean B. Lasserre
ARCHIV DER MATHEMATIK (2008)
A semidefinite programming approach to the generalized problem of moments
Jean B. Lasserre
MATHEMATICAL PROGRAMMING (2008)
Invariance and efficiency of convex representations
Chek Beng Chua et al.
MATHEMATICAL PROGRAMMING (2008)
An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming
S. I. Birbil et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
Masakazu Kojima et al.
MATHEMATICAL PROGRAMMING (2007)
Optimization of polynomials on compact semialgebraic sets
M Schweighofer
SIAM JOURNAL ON OPTIMIZATION (2005)
Polynomial programming: LP-relaxations also converge
JB Lasserre
SIAM JOURNAL ON OPTIMIZATION (2005)
The Lax conjecture is true
AS Lewis et al.
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY (2005)
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi
D Henrion et al.
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE (2003)
Semidefinite programming relaxations for semialgebraic problems
PA Parrilo
MATHEMATICAL PROGRAMMING (2003)
Semidefinite programming vs. LP relaxations for polynomial programming
JB Lasserre
MATHEMATICS OF OPERATIONS RESEARCH (2002)
Global optimization with polynomials and the problem of moments
JB Lasserre
SIAM JOURNAL ON OPTIMIZATION (2001)