Semidefinite programming relaxations for semialgebraic problems

  title={Semidefinite programming relaxations for semialgebraic problems},
  author={Pablo A. Parrilo},
  journal={Mathematical Programming},
  • P. Parrilo
  • Published 1 May 2003
  • Mathematics, Computer Science
  • Mathematical Programming
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… 
Semidefinite programming and integer programming
Polytopic outer approximations of semialgebraic sets
This paper deals with the problem of finding a polytopic outer approximation P* of a compact semialgebraic set S ⊆ Rn. The computed polytope turns out to be an approximation of the linear hull of the
Convex Quantifier Elimination for Semidefinite Programming
A reasonably fast algorithm to prove and solve SDP exactly by exploiting the convexity of the SDP feasibility domain is proposed by combining a symbolic algorithm of cylindrical algebraic decomposition (CAD) and a lifting strategy that takes into account the conveXity properties of SDP.
Semidefinite representations for finite varieties
  • M. Laurent
  • Mathematics, Computer Science
    Math. Program.
  • 2007
This work proves the finite convergence of a hierarchy of semidefinite relaxations introduced by Lasserre, which involves combinatorial moment matrices indexed by a basis of the quotient vector space ℝ[x1, . . . ,xn]/I.
On solving biquadratic optimization via semidefinite relaxation
This paper first relax the original problem to its semidefinite programming (SDP) problem and discusses the approximation ratio between them, and considers how to approximately solve the problems in polynomial time.
Converging Semidefinite Bounds for Global Unconstrained Polynomial Optimization
It is proposed here a method for computing a converging sequence of upper bounds using semidefinite programming based on perturbing the original polynomial and the method is applied to several examples.
Real ideal and the duality of semidefinite programming for polynomial optimization
We study the ideal generated by polynomials vanishing on a semialgebraic set and give elementary proofs for some equivalent conditions for reality of ideals or S-radical ideals. These results can be
An Extended Semidefinite Relaxation for Satisfiability
  • M. Anjos
  • Computer Science, Mathematics
    J. Satisf. Boolean Model. Comput.
  • 2008
This paper considers the Tseitin instances, a class of instances known to be hard for certain proof systems, and proves that for any choice of permutations, the proposed relaxation is exact for these instances, meaning that a TseItin instance is unsatisfiable if and only if the corresponding semidefinite programming relaxation is infeasible.
Semidefinite Approximations for Global Unconstrained Polynomial Optimization
This work proposes here a method for computing tight upper bounds based on perturbing the original polynomial and using semidefinite programming, and is applied to several examples.


Semidefinite Programming
A survey of the theory and applications of semidefinite programs and an introduction to primaldual interior-point methods for their solution are given.
Nondifferentiable Optimization and Polynomial Problems
  • N. Shor
  • Mathematics, Computer Science
  • 1998
This book discusses the role of Ellipsoid Method for Complexity Analysis of Combinatorial Problems, and the importance of Semidefinite Programming Bounds for Extremal Graph Problems.
Copositive realxation for genera quadratic programming
We consider general, typically nonconvex, Quadratic programming Problem. The Semidefinite relaxation proposed by Shor provides bounds on the optimal solution, but it does not always provide
Minimizing Polynomial Functions
  • P. Parrilo, B. Sturmfels
  • Computer Science, Mathematics
    Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science
  • 2001
It is demonstrated that existing algebraic methods are dramatically outperformed by a relaxation technique, due to N.Z. Shor and the first author, which involves sums of squares and semidefinite programming.
Some NP-complete problems in quadratic and nonlinear programming
A special class of indefinite quadratic programs is constructed, with simple constraints and integer data, and it is shown that checking (a) or (b) on this class is NP-complete.
The Moment Problem on Compact Semi-Algebraic Sets
In this chapter we begin the study of the multidimensional moment problem. The passage to dimensions d ≥ 2 brings new difficulties and unexpected phenomena. In Sect. 3.2 we derived solvability
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be characterized exactly. This family corresponds to the case where the
Approximation of the Stability Number of a Graph via Copositive Programming
This paper shows how the stability number can be computed as the solution of a conic linear program (LP) over the cone of copositive matrices of a graph by solving semidefinite programs (SDPs) of increasing size (lift-and-project method).
Stable sets and polynomials