相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。NP-hardness of deciding convexity of quartic polynomials and related problems
Amir Ali Ahmadi et al.
MATHEMATICAL PROGRAMMING (2013)
A convex polynomial that is not sos-convex
Amir Ali Ahmadi et al.
MATHEMATICAL PROGRAMMING (2012)
ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS
Etienne De Klerk et al.
SIAM JOURNAL ON OPTIMIZATION (2011)
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)
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)
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
Nebojsa Gvozdenovic et al.
MATHEMATICAL PROGRAMMING (2007)
Matrix sum-of-squares relaxations for robust semi-definite programs
CW Scherer et al.
MATHEMATICAL PROGRAMMING (2006)
Symmetry groups, semidefinite programs, and sums of squares
K Gatermann et al.
JOURNAL OF PURE AND APPLIED ALGEBRA (2004)
A new approach to Hilbert's theorem on ternary quartics
V Powers et al.
COMPTES RENDUS MATHEMATIQUE (2004)
Semidefinite programming relaxations for semialgebraic problems
PA Parrilo
MATHEMATICAL PROGRAMMING (2003)
Distinguishing separable and entangled states
AC Doherty et al.
PHYSICAL REVIEW LETTERS (2002)