Abstract

A hierarchy of convex relaxations for semialgebraic problems is introduced. For questions reducible to a finite number of polynomial equalities and inequalities, it is shown how to construct a complete family of polynomially sized semidefinite programming conditions that prove infeasibility. The main tools employed are a semidefinite programming formulation of the sum of squares decomposition for multivariate polynomials, and some results from real algebraic geometry. The techniques provide a constructive approach for finding bounded degree solutions to the Positivstellensatz, and are illustrated with examples from diverse application fields.

Citations

773	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming - Goemans, Williamson - 1995
581	S: Semidefinite programming - Vandenberghe, Boyd - 1996
446	The Linear Complementarity Problem - Cottle, Pang, et al. - 1992
220	Global optimization with polynomials and the problem of moments - Lasserre - 2001
211	Cones of matrices and set-functions and 0 , 1 optimization - Lovasz, Schrijver - 1991
199	Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra, UTM - Cox, Little, et al. - 1992
177	On the combinatorial and algebraic complexity of quantifier elimination - Basu, Pollack, et al. - 1996
138	algebraic geometry - Bochnak, Coste, et al. - 1998
137	A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems - Sherali, Adams - 1990
125	Structured semidefinite programs and semialgebraic geometry methods - Parrilo
97	The K-moment problem for compact semi-algebraic sets - Schmüdgen - 1991
91	Algorithmic Algebra - Mishra - 1993
72	Some concrete aspects of Hilbert’s 17th problem, volume 253 of Contemporary Mathematics - Reznick - 2000
71	Squared functional systems and optimization problems - Nesterov - 2000
66	effective Nullstellensatz - Kollar, Sharp - 1988
66	A reformulation-linearization technique for solving discrete and continuous nonconvex problems, Kluwer Book Series: Nonconvex Optimization and its Applications - Sherali, Adams - 1999
61	A comparison of the SheraliAdams, Lovász-Schrijver, and Lasserre relaxations for 0–1 programming - Laurent
54	Some NP-complete problems in quadratic and nonlinear programming - Murty, Kabadi - 1987
54	A nullstellensatz and a positivstellensatz in semialgebraic geometry - Stengle - 1974
53	Bounds for the degrees in the Nullstellensatz - Brownawell - 1987
51	SOSTOOLS: Sum of squares optimization toolbox for MATLAB. http://www.cds.caltech.edu/sostools - Prajna, Papachristodoulou, et al.
41	Symmetry groups, semidefinite programs, and sums of squares - Gatermann, Parrilo
33	Sums of squares of real polynomials - Choi, Lam, et al. - 1995
33	Class of global minimum bounds of polynomial functions - Shor - 1987
32	Algebraic Geometry - Real - 1998
28	Approximating of the stability number of a graph via copositive programming - Klerk, Pasechnik, et al.
28	Nondifferentiable optimization and polynomial problems - Shor - 1998
22	Applied multidimensional systems theory - Bose - 1982
22	Extremal PSD forms with few terms - Reznick - 1978
22	Uniform denominators in Hilbert’s Seventeenth Problem - Reznick - 1995
22	Reznick: A new bound for Pólya’s Theorem with applications to polynomials positive on polyhedra - Powers, B - 2001
21	An explicit construction of distinguished representations of polynomials nonnegative over finite sets. IfA - Parrilo - 2002
11	On non-negative forms in real variables some or all of which are non-negative - Diananda - 1962
11	T.: Copositive relaxation for general quadratic programming. Optimization methods and software 9 - Quist, Klerk, et al. - 1998
7	Struppa: Recent improvements in the complexity of the effective Nullstellensatz. Linear Alg - Berenstein, D - 1991
6	Complexity estimates for the Schmüdgen Positivstellensatz - Stengle - 1996
5	Complexity of Null- and Positivstellensatz proofs - Grigoriev, Vorobjov
4	A quadratic form representation of polynomials of several variables and its applications - Bose, Li - 1968
4	Stable sets and polynomials. Discrete mathematics 124 - Lovász - 1994
4	Minimizing polynomials functions. Submitted to the DIMACS volume - Parrilo, Sturmfels
4	T.: An algorithm for sums of squares of real polynomials. Journal of pure and applied algebra 127 - Powers, Wörmann - 1998
4	Criteria for copositive matrices. LinearAlgebra and its applications 81 - Väliaho - 1986
4	On a decomposition for multivariable forms via LMI methods - Parrilo
3	An old question of Hilbert. Queen’s papers in pure and applied mathematics 46 - Choi, Y - 1977
3	Hilbert’s 17th problem and best dual bounds in quadratic minimization - Ferrier - 1998
3	A procedure for the positive definiteness of forms of even order - Hasan, Hasan - 1996
3	On the discriminant of real symmetric matrices - Lax - 1998
3	The Use of Symbolic Methods in Control System Analysis and Design, volume 56 of Control engineering series - Munro, editor - 1999
3	Comments on “A procedure for the positive definiteness of forms of even order - Fu - 1998
2	Comments on "A procedure for the positive definiteness of forms of even order - Fu - 1998