Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry

Size: px
Start display at page:

Download "Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry"

Transcription

1 Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry Rekha R. Thomas University of Washington, Seattle

2 References Monique Laurent, Sums of squares, moment matrices and optimization over polynomials, IMA Volume, to appear Murray Marshall, Positive polynomials and sums of squares, AMS 2008 João Gouveia, Pablo Parrilo, Rekha Thomas, Theta bodies for polynomial ideals, preprint 2008.

3 Polynomial Optimization: p := inf{p(x) : x K} ( ) K = {x R n : g 1 0,...,g m 0,h 1 = 0,...,h s = 0} (basic semialgebraic set), p,g i,h j R[x] := R[x 1,...,x n ] K = R n unconstrained polynomial optimization m = 0 K =V R (I) real variety of I = h 1,...,h m R[x] non-convex optimization problem NP-hard even when deg(p) = 4 and K = R n. GOAL: Find a sequence of relaxations of ( ) by convex optimization problems that converges to ( ).

4 Examples (all NP complete) Partition problem: Given a 1,...,a n Z +, does there exist x {±1} n s.t. a i x i = 0? Yes p = 0 for p := ( n i=1 a ix i ) 2+ n i=1 (x2 i 1)2. Distance realization: Given distances d := (d i j ) R E, d is realizable in R k if there exists v 1,...,v n R k such that d i j = v i v j for all i j E. d realizable in R k p = 0 for p := i j E (d 2 i j k h=1 (x ih x jh ) 2) 2. 0/1 Integer programming: min{c x : Ax b, x 2 i = x i i [n]}

5 Semidefinite programming vector space: Symm(R n n ) trace product: A,B Symm(R n n ), A B := trace(ab) positive semidefinite: A 0 v t Av 0 for all v R n A = BB t for some B R n m all eigenvalues of A are non-negative semidefinite program (sdp): sup{c X : A j X = b j, j = 1,...,m, X 0} convex optimization, polynomial time algorithms Linear programming is SDP over diagonal matrices

6 Hilbert s 17th problem P n := {p R[x] : p(x) 0, x R n } non-negative polynomials Σ n := { h 2 j : h j R[x]} sum of squares (sos) of polynomials P n,d, Σ n,d polynomials of degree at most d inp n and Σ n Σ n P n and Σ n,d P n,d cones in R[x] Hilbert 1888: Σ n,d =P n,d n = 1 or d = 2 or (n,d) = (2,4). Hilbert s 17th problem: Is every p P n a sos of rational functions? Yes! Artin 1927 using Tarski s transfer principle and orderings on fields

7 Motzkin (1967): s(x,y) := 1 3x 2 y 2 + x 2 y 4 + x 4 y 2 s(x,y) P 2,6 \ Σ 2,6 a+b+c 3 3 abc a,b,c 0, a := 1, b := x 2 y 4, c := x 4 y 2 Blekherman (2006): for d fixed, many more nonnegative forms than sos forms as n Lasserre (2006): for n fixed, any nonnegative polynomial can be approximated arbitrarily closely by sos polynomials.

8 Testing for sos representations via SDP p = x 4 + 2x 3 y+3x 2 y 2 + 2xy 3 + 2y 4 sos A 0 s.t. p = (x 2,xy,y 2 ) a 11 a 12 a 12 a 22 a 13 a 23 a 13 a 23 a 33 x2 xy y 2 the sdp {A 0 : a 11 = 1,a 12 = 1,a a 13 = 3,a 23 = 1,a 33 = 2} is feasible ( ) ex: A = B t B for B = or B = 0 3/2 3/ /2 1/2 p = (x 2 + xy y 2 ) 2 +(y 2 + 2xy) 2 = (x 2 + xy) (xy+y2 ) (xy y2 ) 2

9 Sos relaxations for p := inf{p(x) : x K} p := sup{ρ : p ρ 0 on K} = sup{ρ : p ρ > 0 on K} K = R n : p sos := sup{ρ : p ρ is sos} CAUTION Motzkin polynomial: p sos = < p = 0 K = {x R n : g 1 0,...,g m 0} : p sos := sup{ρ : p ρ = s 0 + m i=1 s ig i, s i sos} to get sdps we look at successive truncations: p sos t := sup{ρ : p ρ = s 0 + m i=1 s ig i, s i sos, deg(s 0 ),deg(s i g i ) 2t} p sos t pt+1 sos psos p, lim t pt sos = p sos

10 Positivstellensatz (Krivine 1964, Stengle 1974) T := { s i (g i 1 1 g i 2 2 g i m m ) : (i 1,...,i m ) {0,1} m, s i sos} preorder non-negativity set of K = {x R n : g 1 0,...,g m 0}. Positivstellensatz: Given p R[x], (i) p > 0 on K p f = 1+g, f,g T (ii) p 0 on K p f = p 2k + g, f,g T (solves Hilbert s 17th prob) (iii) p = 0 on K p 2k T (iv) K = /0 1 T (compare: Hilbert s weak Nullstellensatz) Real Nullstellensatz: p vanishes on {x R n : h 1 = = h s = 0} p 2k + s = s j=1 u jh j for u j R[x],s sos. (Hilbert s strong NS)

11 Schmüdgen s & Putinar s refinements p := sup{ρ : p ρ > 0 on K} = sup{ρ : (p ρ) f = 1+g, f,g T }. Schmüdgen 1991: If K is compact then p > 0 on K p T. p Schm t = sup{ρ : (p ρ) = s i (g i 1 1 g i 2 2 g i m m ), s i sos, deg( ) t} (sdp, lim t p Schm t = p, involves 2 m terms!) Putinar 1993: If K is Archimedean then p > 0 on K p M. M := {s 0 + m i=1 s ig i : s 0,s i sos} quadratic module p Put t = sup{ρ : (p ρ) = s 0 + s i g i, s 0,s i sos, deg( ) t} (sdp, lim t p Put t = p, only m+1 terms!)

12 Moments of probability measures µ probability measure on R n : y α := R x α dµ moment of order α y := (y α : α N n ) moment sequence of µ K-moment problem: Characterize moment sequences of measures supported on K R n. y R Nn moment sequence: moment matrix: M(y) R Nn N n : M(y) (α,β) := y α+β truncated moment matrix: M t (y) principal submatrix of M(y) indexed by N n t

13 Moment relaxations for p := inf{p(x) : x K} y R Nn 2t (truncated) moment sequence of µ on K t d K, M t (y) 0, M t dk (g i y) 0, i = 1,...,m p = inf{ R K p(x)dµ : µ prob measure on K} = inf{p t y : y 0 = 1,y mom seq of µ on K} p mom := inf{p t y : y 0 = 1, M(y) 0, M(g i y) 0, i = 1,...,m} to get sdps we look at successive truncations: p mom t := inf{p t y : y 0 = 1, M t (y) 0, M t dk (g i y) 0, i, y R Nn 2t} p mom t pt+1 mom p mom p, lim t pt mom = p mom

14 Duality Recall:P = {p : p(x) 0, x R n }, Σ = { h 2 j : h j R[x]}. DefineM := {y R Nn : y mom seq of µ on R n } R[x] M := {y R Nn : M(y) 0} R[x] Haviland 1935P =M,P =M Berg,Christensen,Jensen 1979: Σ =M, Σ =M Corollary: (n = 1) M =M Hamburger s theorem K-versions of these dual cones sdp duality p sos t p mom t p sos p mom p

15 Theta Body of a Graph G = ([n],e) undirected graph STAB(G) := conv{χ S : S stable set in G} max stable set problem: max{ x i : x STAB(G)} (NP-hard) I G := x i : i [n], x i x j : i j E V (I G ) = {χ S : S stable set in G} Lovász 1980 TH(G) := {x R n : f(x) 0 f linear, f 1-sos mod I G } STAB(G) G perfect STAB(G) = TH(G) stable set problem solved in poly time if G perfect: max{ x i : x TH(G)} is an sdp

16 Lovász 1994: Which ideals I R[x] are perfect? ( f linear, f 0 onv R (I) f is 1-sos mod I). f R[x] k-sos mod I if f h 2 j mod I, deg(h j) k I is k-perfect if every linear f 0 mod I is k-sos mod I T H k (I) := {x R n : f(x) 0, f linear f k-sos mod I} TH 1 (I) TH 2 (I) conv(v R (I)) theta bodies for ideals Gouveia, Parrilo, T T H k (I) is the closure of the projection of a spectrahedron I =I(S), S R n I k-perfect conv(v R (I)) = TH k (I) I =I(S), S finite I perfect for every facet inequality g(x) 0 of conv(s), S {g(x) = 0} {g(x) = c g } In this case, # facets, # vertices 2 n (both sharp)

17 y Convex Algebraic Geometry TH 1 (I) TH 2 (I) conv(v R (I)) Theta bodies approximate convex hulls of real varieties Compute theta bodies via sdp, convergence in many cases Gouveia, Parrilo, T For I R[x], TH 1 (I) = {conv(v R (F)) : F convex quadric in I} Ex. S = {(0,0),(1,0),(0,1),(2,2)} x

Optimization over Polynomials with Sums of Squares and Moment Matrices

Optimization over Polynomials with Sums of Squares and Moment Matrices Optimization over Polynomials with Sums of Squares and Moment Matrices Monique Laurent Centrum Wiskunde & Informatica (CWI), Amsterdam and University of Tilburg Positivity, Valuations and Quadratic Forms

More information

Representations of Positive Polynomials: Theory, Practice, and

Representations of Positive Polynomials: Theory, Practice, and Representations of Positive Polynomials: Theory, Practice, and Applications Dept. of Mathematics and Computer Science Emory University, Atlanta, GA Currently: National Science Foundation Temple University

More information

The moment-lp and moment-sos approaches

The moment-lp and moment-sos approaches The moment-lp and moment-sos approaches LAAS-CNRS and Institute of Mathematics, Toulouse, France CIRM, November 2013 Semidefinite Programming Why polynomial optimization? LP- and SDP- CERTIFICATES of POSITIVITY

More information

A new look at nonnegativity on closed sets

A new look at nonnegativity on closed sets A new look at nonnegativity on closed sets LAAS-CNRS and Institute of Mathematics, Toulouse, France IPAM, UCLA September 2010 Positivstellensatze for semi-algebraic sets K R n from the knowledge of defining

More information

6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC

6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC 6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC 2003 2003.09.02.10 6. The Positivstellensatz Basic semialgebraic sets Semialgebraic sets Tarski-Seidenberg and quantifier elimination Feasibility

More information

On Polynomial Optimization over Non-compact Semi-algebraic Sets

On Polynomial Optimization over Non-compact Semi-algebraic Sets On Polynomial Optimization over Non-compact Semi-algebraic Sets V. Jeyakumar, J.B. Lasserre and G. Li Revised Version: April 3, 2014 Communicated by Lionel Thibault Abstract The optimal value of a polynomial

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has

More information

Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares

Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares Journal of Global Optimization (2005) 33: 511 525 Springer 2005 DOI 10.1007/s10898-005-2099-2 Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares JIAWANG NIE 1 and JAMES W.

More information

A NEW SEMIDEFINITE PROGRAMMING HIERARCHY FOR CYCLES IN BINARY MATROIDS AND CUTS IN GRAPHS

A NEW SEMIDEFINITE PROGRAMMING HIERARCHY FOR CYCLES IN BINARY MATROIDS AND CUTS IN GRAPHS A NEW SEMIDEFINITE PROGRAMMING HIERARCHY FOR CYCLES IN BINARY MATROIDS AND CUTS IN GRAPHS JOÃO GOUVEIA, MONIQUE LAURENT, PABLO A. PARRILO, AND REKHA THOMAS Abstract. The theta bodies of a polynomial ideal

More information

An Exact Jacobian SDP Relaxation for Polynomial Optimization

An Exact Jacobian SDP Relaxation for Polynomial Optimization An Exact Jacobian SDP Relaxation for Polynomial Optimization Jiawang Nie May 26, 2011 Abstract Given polynomials f(x), g i (x), h j (x), we study how to imize f(x) on the set S = {x R n : h 1 (x) = = h

More information

SPECTRAHEDRA. Bernd Sturmfels UC Berkeley

SPECTRAHEDRA. Bernd Sturmfels UC Berkeley SPECTRAHEDRA Bernd Sturmfels UC Berkeley GAeL Lecture I on Convex Algebraic Geometry Coimbra, Portugal, Monday, June 7, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following

More information

Non-Convex Optimization via Real Algebraic Geometry

Non-Convex Optimization via Real Algebraic Geometry Non-Convex Optimization via Real Algebraic Geometry Constantine Caramanis Massachusetts Institute of Technology November 29, 2001 The following paper represents the material from a collection of different

More information

Notes on the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre by M. Laurent, December 13, 2012

Notes on the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre by M. Laurent, December 13, 2012 Notes on the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre by M. Laurent, December 13, 2012 We present the decomposition result of Karlin et al. [2] for the hierarchy of Lasserre

More information

How to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization

How to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization CS-11-01 How to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization Hayato Waki Department of Computer Science, The University of Electro-Communications

More information

Moments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations

Moments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations Moments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations LAAS-CNRS and Institute of Mathematics, Toulouse, France Tutorial, IMS, Singapore 2012 LP-relaxations LP- VERSUS SDP-relaxations

More information

LMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009

LMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009 LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix

More information

Lift-and-Project Techniques and SDP Hierarchies

Lift-and-Project Techniques and SDP Hierarchies MFO seminar on Semidefinite Programming May 30, 2010 Typical combinatorial optimization problem: max c T x s.t. Ax b, x {0, 1} n P := {x R n Ax b} P I := conv(k {0, 1} n ) LP relaxation Integral polytope

More information

Moments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations

Moments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations Moments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations LAAS-CNRS and Institute of Mathematics, Toulouse, France EECI Course: February 2016 LP-relaxations LP- VERSUS SDP-relaxations

More information

Positive semidefinite rank

Positive semidefinite rank 1/15 Positive semidefinite rank Hamza Fawzi (MIT, LIDS) Joint work with João Gouveia (Coimbra), Pablo Parrilo (MIT), Richard Robinson (Microsoft), James Saunderson (Monash), Rekha Thomas (UW) DIMACS Workshop

More information

Semidefinite programming relaxations for semialgebraic problems

Semidefinite programming relaxations for semialgebraic problems Mathematical Programming manuscript No. (will be inserted by the editor) Pablo A. Parrilo Semidefinite programming relaxations for semialgebraic problems Abstract. A hierarchy of convex relaxations for

More information

Ranks of Real Symmetric Tensors

Ranks of Real Symmetric Tensors Ranks of Real Symmetric Tensors Greg Blekherman SIAM AG 2013 Algebraic Geometry of Tensor Decompositions Real Symmetric Tensor Decompositions Let f be a form of degree d in R[x 1,..., x n ]. We would like

More information

Semidefinite programming lifts and sparse sums-of-squares

Semidefinite programming lifts and sparse sums-of-squares 1/15 Semidefinite programming lifts and sparse sums-of-squares Hamza Fawzi (MIT, LIDS) Joint work with James Saunderson (UW) and Pablo Parrilo (MIT) Cornell ORIE, October 2015 Linear optimization 2/15

More information

Rational Sums of Squares and Applications

Rational Sums of Squares and Applications f ΣR[X] 2 " f ΣQ[X] 2 Rational Sums of Squares and Applications Christopher Hillar (MSRI & Berkeley) A 2008 study found that adding a picture of a brain scan to a scientific argument about human nature

More information

Convex Optimization. (EE227A: UC Berkeley) Lecture 28. Suvrit Sra. (Algebra + Optimization) 02 May, 2013

Convex Optimization. (EE227A: UC Berkeley) Lecture 28. Suvrit Sra. (Algebra + Optimization) 02 May, 2013 Convex Optimization (EE227A: UC Berkeley) Lecture 28 (Algebra + Optimization) 02 May, 2013 Suvrit Sra Admin Poster presentation on 10th May mandatory HW, Midterm, Quiz to be reweighted Project final report

More information

Convex algebraic geometry, optimization and applications

Convex algebraic geometry, optimization and applications Convex algebraic geometry, optimization and applications The American Institute of Mathematics The following compilation of participant contributions is only intended as a lead-in to the AIM workshop Convex

More information

Advanced SDPs Lecture 6: March 16, 2017

Advanced SDPs Lecture 6: March 16, 2017 Advanced SDPs Lecture 6: March 16, 2017 Lecturers: Nikhil Bansal and Daniel Dadush Scribe: Daniel Dadush 6.1 Notation Let N = {0, 1,... } denote the set of non-negative integers. For α N n, define the

More information

Convex sets, matrix factorizations and positive semidefinite rank

Convex sets, matrix factorizations and positive semidefinite rank Convex sets, matrix factorizations and positive semidefinite rank Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of

More information

Global Minimization of Rational Functions and the Nearest GCDs

Global Minimization of Rational Functions and the Nearest GCDs Global Minimization of Rational Functions and the Nearest GCDs Jiawang Nie James Demmel and Ming Gu January 12, 2006 Abstract This paper discusses the global minimization of rational functions with or

More information

Semidefinite programming and convex algebraic geometry

Semidefinite programming and convex algebraic geometry FoCM 2008 - SDP and convex AG p. 1/40 Semidefinite programming and convex algebraic geometry Pablo A. Parrilo www.mit.edu/~parrilo Laboratory for Information and Decision Systems Electrical Engineering

More information

COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion

COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION   henrion COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F

More information

arxiv: v1 [math.oc] 9 Sep 2015

arxiv: v1 [math.oc] 9 Sep 2015 CONTAINMENT PROBLEMS FOR PROJECTIONS OF POLYHEDRA AND SPECTRAHEDRA arxiv:1509.02735v1 [math.oc] 9 Sep 2015 KAI KELLNER Abstract. Spectrahedra are affine sections of the cone of positive semidefinite matrices

More information

A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs

A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters.

More information

Solving Global Optimization Problems with Sparse Polynomials and Unbounded Semialgebraic Feasible Sets

Solving Global Optimization Problems with Sparse Polynomials and Unbounded Semialgebraic Feasible Sets Solving Global Optimization Problems with Sparse Polynomials and Unbounded Semialgebraic Feasible Sets V. Jeyakumar, S. Kim, G. M. Lee and G. Li June 6, 2014 Abstract We propose a hierarchy of semidefinite

More information

LIFTS OF CONVEX SETS AND CONE FACTORIZATIONS JOÃO GOUVEIA, PABLO A. PARRILO, AND REKHA THOMAS

LIFTS OF CONVEX SETS AND CONE FACTORIZATIONS JOÃO GOUVEIA, PABLO A. PARRILO, AND REKHA THOMAS LIFTS OF CONVEX SETS AND CONE FACTORIZATIONS Abstract. In this paper we address the basic geometric question of when a given convex set is the image under a linear map of an affine slice of a given closed

More information

SPECTRAHEDRA. Bernd Sturmfels UC Berkeley

SPECTRAHEDRA. Bernd Sturmfels UC Berkeley SPECTRAHEDRA Bernd Sturmfels UC Berkeley Mathematics Colloquium, North Carolina State University February 5, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent:

More information

A brief history of noncommutative Positivstellensätze. Jaka Cimprič, University of Ljubljana, Slovenia

A brief history of noncommutative Positivstellensätze. Jaka Cimprič, University of Ljubljana, Slovenia A brief history of noncommutative Positivstellensätze Jaka Cimprič, University of Ljubljana, Slovenia Hilbert s Nullstellensatz: If f, g 1,..., g m R := C[X 1,..., X n ] then the following are equivalent:

More information

The Geometry of Semidefinite Programming. Bernd Sturmfels UC Berkeley

The Geometry of Semidefinite Programming. Bernd Sturmfels UC Berkeley The Geometry of Semidefinite Programming Bernd Sturmfels UC Berkeley Positive Semidefinite Matrices For a real symmetric n n-matrix A the following are equivalent: All n eigenvalues of A are positive real

More information

Lifts of Convex Sets and Cone Factorizations

Lifts of Convex Sets and Cone Factorizations Lifts of Convex Sets and Cone Factorizations The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Gouveia,

More information

Comparison of Lasserre s measure based bounds for polynomial optimization to bounds obtained by simulated annealing

Comparison of Lasserre s measure based bounds for polynomial optimization to bounds obtained by simulated annealing Comparison of Lasserre s measure based bounds for polynomial optimization to bounds obtained by simulated annealing Etienne de lerk Monique Laurent March 2, 2017 Abstract We consider the problem of minimizing

More information

Introduction to Semidefinite Programming I: Basic properties a

Introduction to Semidefinite Programming I: Basic properties a Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite

More information

Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems

Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems V. Jeyakumar and G. Li Revised Version:August 31, 2012 Abstract An exact semidefinite linear programming (SDP) relaxation

More information

LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS

LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS MEHDI GHASEMI AND MURRAY MARSHALL Abstract. Recently Lasserre [6] gave a sufficient condition in terms of the coefficients for a polynomial f

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Basics and SOS Fernando Mário de Oliveira Filho Campos do Jordão, 2 November 23 Available at: www.ime.usp.br/~fmario under talks Conic programming V is a real vector space h, i

More information

SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS. February 5, 2008

SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS. February 5, 2008 SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT February 5, 2008 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial

More information

9. Interpretations, Lifting, SOS and Moments

9. Interpretations, Lifting, SOS and Moments 9-1 Interpretations, Lifting, SOS and Moments P. Parrilo and S. Lall, CDC 2003 2003.12.07.04 9. Interpretations, Lifting, SOS and Moments Polynomial nonnegativity Sum of squares (SOS) decomposition Eample

More information

Copositive Programming and Combinatorial Optimization

Copositive Programming and Combinatorial Optimization Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with M. Bomze (Wien) and F. Jarre (Düsseldorf) and

More information

Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets

Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets Milan Korda 1, Didier Henrion,3,4 Draft of December 1, 016 Abstract Moment-sum-of-squares hierarchies

More information

CLOSURES OF QUADRATIC MODULES

CLOSURES OF QUADRATIC MODULES CLOSURES OF QUADRATIC MODULES JAKA CIMPRIČ, MURRAY MARSHALL, TIM NETZER Abstract. We consider the problem of determining the closure M of a quadratic module M in a commutative R-algebra with respect to

More information

MTNS Conference, Polynomial Inequalities and Applications. Kyoto, July

MTNS Conference, Polynomial Inequalities and Applications. Kyoto, July MTNS Conference, Polynomial Inequalities and Applications. Kyoto, July 24-28 2006. July 20, 2006 Salma Kuhlmann 1, Research Center Algebra, Logic and Computation University of Saskatchewan, McLean Hall,

More information

Robust and Optimal Control, Spring 2015

Robust and Optimal Control, Spring 2015 Robust and Optimal Control, Spring 2015 Instructor: Prof. Masayuki Fujita (S5-303B) G. Sum of Squares (SOS) G.1 SOS Program: SOS/PSD and SDP G.2 Duality, valid ineqalities and Cone G.3 Feasibility/Optimization

More information

Global Optimization with Polynomials

Global Optimization with Polynomials Global Optimization with Polynomials Deren Han Singapore-MIT Alliance National University of Singapore Singapore 119260 Email: smahdr@nus.edu.sg Abstract The class of POP (Polynomial Optimization Problems)

More information

Optimization over Nonnegative Polynomials: Algorithms and Applications. Amir Ali Ahmadi Princeton, ORFE

Optimization over Nonnegative Polynomials: Algorithms and Applications. Amir Ali Ahmadi Princeton, ORFE Optimization over Nonnegative Polynomials: Algorithms and Applications Amir Ali Ahmadi Princeton, ORFE INFORMS Optimization Society Conference (Tutorial Talk) Princeton University March 17, 2016 1 Optimization

More information

Convex algebraic geometry, optimization and applications

Convex algebraic geometry, optimization and applications Convex algebraic geometry, optimization and applications organized by William Helton and Jiawang Nie Workshop Summary We start with a little bit of terminology. A linear pencil is a function L : R g d

More information

Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows

Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows Shaowei Lin 9 Dec 2010 Abstract Recently, Helton and Nie [3] showed that a compact convex semialgebraic set S is a spectrahedral shadow if the

More information

Real solving polynomial equations with semidefinite programming

Real solving polynomial equations with semidefinite programming .5cm. Real solving polynomial equations with semidefinite programming Jean Bernard Lasserre - Monique Laurent - Philipp Rostalski LAAS, Toulouse - CWI, Amsterdam - ETH, Zürich LAW 2008 Real solving polynomial

More information

The maximal stable set problem : Copositive programming and Semidefinite Relaxations

The maximal stable set problem : Copositive programming and Semidefinite Relaxations The maximal stable set problem : Copositive programming and Semidefinite Relaxations Kartik Krishnan Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy, NY 12180 USA kartis@rpi.edu

More information

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize

More information

arxiv: v1 [math.oc] 28 Dec 2018

arxiv: v1 [math.oc] 28 Dec 2018 On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems Feng Guo a, Xiaoxia un b a chool of Mathematical ciences, Dalian University of Technology, Dalian, 64, China

More information

Effectivity Issues and Results for Hilbert 17 th Problem

Effectivity Issues and Results for Hilbert 17 th Problem Effectivity Issues and Results for Hilbert 17 th Problem Marie-Françoise Roy Université de Rennes 1, France joint work with Henri Lombardi Université de Franche-Comté, France and Daniel Perrucci Universidad

More information

Semidefinite Programming Basics and Applications

Semidefinite Programming Basics and Applications Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent

More information

Semidefinite programming techniques in combinatorial optimization

Semidefinite programming techniques in combinatorial optimization Semidefinite programming techniques in combinatorial optimization Dept. of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo July 22 26, 2016 We will start with the discussion

More information

Convex sets, conic matrix factorizations and conic rank lower bounds

Convex sets, conic matrix factorizations and conic rank lower bounds Convex sets, conic matrix factorizations and conic rank lower bounds Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute

More information

4. Algebra and Duality

4. Algebra and Duality 4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone

More information

Convex Optimization & Parsimony of L p-balls representation

Convex Optimization & Parsimony of L p-balls representation Convex Optimization & Parsimony of L p -balls representation LAAS-CNRS and Institute of Mathematics, Toulouse, France IMA, January 2016 Motivation Unit balls associated with nonnegative homogeneous polynomials

More information

MINI-TUTORIAL ON SEMI-ALGEBRAIC PROOF SYSTEMS. Albert Atserias Universitat Politècnica de Catalunya Barcelona

MINI-TUTORIAL ON SEMI-ALGEBRAIC PROOF SYSTEMS. Albert Atserias Universitat Politècnica de Catalunya Barcelona MINI-TUTORIAL ON SEMI-ALGEBRAIC PROOF SYSTEMS Albert Atserias Universitat Politècnica de Catalunya Barcelona Part I CONVEX POLYTOPES Convex polytopes as linear inequalities Polytope: P = {x R n : Ax b}

More information

4-1 The Algebraic-Geometric Dictionary P. Parrilo and S. Lall, ECC

4-1 The Algebraic-Geometric Dictionary P. Parrilo and S. Lall, ECC 4-1 The Algebraic-Geometric Dictionary P. Parrilo and S. Lall, ECC 2003 2003.09.02.02 4. The Algebraic-Geometric Dictionary Equality constraints Ideals and Varieties Feasibility problems and duality The

More information

Copositive Programming and Combinatorial Optimization

Copositive Programming and Combinatorial Optimization Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with I.M. Bomze (Wien) and F. Jarre (Düsseldorf) IMA

More information

Strange Behaviors of Interior-point Methods. for Solving Semidefinite Programming Problems. in Polynomial Optimization

Strange Behaviors of Interior-point Methods. for Solving Semidefinite Programming Problems. in Polynomial Optimization CS-08-02 Strange Behaviors of Interior-point Methods for Solving Semidefinite Programming Problems in Polynomial Optimization Hayato Waki, Maho Nakata, and Masakazu Muramatsu Department of Computer Science,

More information

Lecture 4: Polynomial Optimization

Lecture 4: Polynomial Optimization CS369H: Hierarchies of Integer Programming Relaxations Spring 2016-2017 Lecture 4: Polynomial Optimization Professor Moses Charikar Scribes: Mona Azadkia 1 Introduction Non-negativity over the hypercube.

More information

Global Optimization of Polynomials

Global Optimization of Polynomials Semidefinite Programming Lecture 9 OR 637 Spring 2008 April 9, 2008 Scribe: Dennis Leventhal Global Optimization of Polynomials Recall we were considering the problem min z R n p(z) where p(z) is a degree

More information

An explicit construction of distinguished representations of polynomials nonnegative over finite sets

An explicit construction of distinguished representations of polynomials nonnegative over finite sets An explicit construction of distinguished representations of polynomials nonnegative over finite sets Pablo A. Parrilo Automatic Control Laboratory Swiss Federal Institute of Technology Physikstrasse 3

More information

The moment-lp and moment-sos approaches in optimization

The moment-lp and moment-sos approaches in optimization The moment-lp and moment-sos approaches in optimization LAAS-CNRS and Institute of Mathematics, Toulouse, France Workshop Linear Matrix Inequalities, Semidefinite Programming and Quantum Information Theory

More information

Describing convex semialgebraic sets by linear matrix inequalities. Markus Schweighofer. Universität Konstanz

Describing convex semialgebraic sets by linear matrix inequalities. Markus Schweighofer. Universität Konstanz Describing convex semialgebraic sets by linear matrix inequalities Markus Schweighofer Universität Konstanz Convex algebraic geometry, optimization and applications American Institute of Mathematics, Palo

More information

Lower bounds on the size of semidefinite relaxations. David Steurer Cornell

Lower bounds on the size of semidefinite relaxations. David Steurer Cornell Lower bounds on the size of semidefinite relaxations David Steurer Cornell James R. Lee Washington Prasad Raghavendra Berkeley Institute for Advanced Study, November 2015 overview of results unconditional

More information

arxiv: v1 [math.oc] 31 Jan 2017

arxiv: v1 [math.oc] 31 Jan 2017 CONVEX CONSTRAINED SEMIALGEBRAIC VOLUME OPTIMIZATION: APPLICATION IN SYSTEMS AND CONTROL 1 Ashkan Jasour, Constantino Lagoa School of Electrical Engineering and Computer Science, Pennsylvania State University

More information

Regular and Positive noncommutative rational functions

Regular and Positive noncommutative rational functions Regular and Positive noncommutative rational functions J. E. Pascoe WashU pascoej@math.wustl.edu June 4, 2016 Joint work with Igor Klep and Jurij Volčič 1 / 23 Positive numbers: the start of real algebraic

More information

On the Complexity of Testing Attainment of the Optimal Value in Nonlinear Optimization

On the Complexity of Testing Attainment of the Optimal Value in Nonlinear Optimization On the Complexity of Testing Attainment of the Optimal Value in Nonlinear Optimization Amir Ali Ahmadi and Jeffrey Zhang Abstract We prove that unless P=NP, there exists no polynomial time (or even pseudo-polynomial

More information

Matricial real algebraic geometry

Matricial real algebraic geometry Magdeburg, February 23th, 2012 Notation R - a commutative ring M n (R) - the ring of all n n matrices with entries in R S n (R) - the set of all symmetric matrices in M n (R) Mn (R) 2 - the set of all

More information

Semi-definite representibility. For fun and profit

Semi-definite representibility. For fun and profit Semi-definite representation For fun and profit March 9, 2010 Introduction Any convex quadratic constraint x T C T Cx a + b T x Can be recast as the linear matrix inequality (LMI): ( ) In Cx (Cx) T a +

More information

on Semialgebraic Sets for Nonnnegative Polynomials Finding Representations

on Semialgebraic Sets for Nonnnegative Polynomials Finding Representations Finding Representations for Nonnnegative Polynomials on Semialgebraic Sets Ruchira Datta Department of Mathematics University of California Berkeley, California April 2nd, 2002 1 Introducing Polynomial

More information

Semidefinite representation of convex sets and convex hulls

Semidefinite representation of convex sets and convex hulls Semidefinite representation of convex sets and convex hulls J. William Helton 1 and Jiawang Nie 2 1 Department of Mathematics, University of California, 9500 Gilman Drive, La Jolla, CA 92093. helton@math.ucsd.edu

More information

Semidefinite Representation of Convex Sets

Semidefinite Representation of Convex Sets Mathematical Programming manuscript No. (will be inserted by the editor J. William Helton Jiawang Nie Semidefinite Representation of Convex Sets the date of receipt and acceptance should be inserted later

More information

Large graphs and symmetric sums of squares

Large graphs and symmetric sums of squares Large graphs and symmetric sums of squares Annie Raymond joint with Greg Blekherman, Mohit Singh and Rekha Thomas University of Massachusetts, Amherst October 18, 018 An example Theorem (Mantel, 1907)

More information

Sum of Squares Relaxations for Polynomial Semi-definite Programming

Sum of Squares Relaxations for Polynomial Semi-definite Programming Sum of Squares Relaxations for Polynomial Semi-definite Programming C.W.J. Hol, C.W. Scherer Delft University of Technology, Delft Center of Systems and Control (DCSC) Mekelweg 2, 2628CD Delft, The Netherlands

More information

Approximate Optimal Designs for Multivariate Polynomial Regression

Approximate Optimal Designs for Multivariate Polynomial Regression Approximate Optimal Designs for Multivariate Polynomial Regression Fabrice Gamboa Collaboration with: Yohan de Castro, Didier Henrion, Roxana Hess, Jean-Bernard Lasserre Universität Potsdam 16th of February

More information

Optimization of Polynomials

Optimization of Polynomials Optimization of Polynomials Matthew M. Peet Arizona State University Thanks to S. Lall and P. Parrilo for guidance and supporting material Lecture 03: Optimization of Polynomials Overview In this lecture,

More information

ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION

ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION Annales Univ. Sci. Budapest., Sect. Comp. 33 (2010) 273-284 ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION L. László (Budapest, Hungary) Dedicated to Professor Ferenc Schipp on his 70th

More information

CONVEXITY IN SEMI-ALGEBRAIC GEOMETRY AND POLYNOMIAL OPTIMIZATION

CONVEXITY IN SEMI-ALGEBRAIC GEOMETRY AND POLYNOMIAL OPTIMIZATION CONVEXITY IN SEMI-ALGEBRAIC GEOMETRY AND POLYNOMIAL OPTIMIZATION JEAN B. LASSERRE Abstract. We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic

More information

arxiv:math/ v3 [math.oc] 5 Oct 2007

arxiv:math/ v3 [math.oc] 5 Oct 2007 arxiv:math/0606476v3 [math.oc] 5 Oct 2007 Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials Jiawang Nie and James Demmel March 27, 2018 Abstract This paper discusses

More information

Chapter 7 Polynomial Functions. Factoring Review. We will talk about 3 Types: ALWAYS FACTOR OUT FIRST! Ex 2: Factor x x + 64

Chapter 7 Polynomial Functions. Factoring Review. We will talk about 3 Types: ALWAYS FACTOR OUT FIRST! Ex 2: Factor x x + 64 Chapter 7 Polynomial Functions Factoring Review We will talk about 3 Types: 1. 2. 3. ALWAYS FACTOR OUT FIRST! Ex 1: Factor x 2 + 5x + 6 Ex 2: Factor x 2 + 16x + 64 Ex 3: Factor 4x 2 + 6x 18 Ex 4: Factor

More information

POSITIVITY AND SUMS OF SQUARES: A GUIDE TO RECENT RESULTS

POSITIVITY AND SUMS OF SQUARES: A GUIDE TO RECENT RESULTS POSITIVITY AND SUMS OF SQUARES: A GUIDE TO RECENT RESULTS CLAUS SCHEIDERER Abstract. This paper gives a survey, with detailed references to the literature, on recent developments in real algebra and geometry

More information

Agenda. Applications of semidefinite programming. 1 Control and system theory. 2 Combinatorial and nonconvex optimization

Agenda. Applications of semidefinite programming. 1 Control and system theory. 2 Combinatorial and nonconvex optimization Agenda Applications of semidefinite programming 1 Control and system theory 2 Combinatorial and nonconvex optimization 3 Spectral estimation & super-resolution Control and system theory SDP in wide use

More information

Complexity of Deciding Convexity in Polynomial Optimization

Complexity of Deciding Convexity in Polynomial Optimization Complexity of Deciding Convexity in Polynomial Optimization Amir Ali Ahmadi Joint work with: Alex Olshevsky, Pablo A. Parrilo, and John N. Tsitsiklis Laboratory for Information and Decision Systems Massachusetts

More information

Completely Positive Reformulations for Polynomial Optimization

Completely Positive Reformulations for Polynomial Optimization manuscript No. (will be inserted by the editor) Completely Positive Reformulations for Polynomial Optimization Javier Peña Juan C. Vera Luis F. Zuluaga Received: date / Accepted: date Abstract Polynomial

More information

A notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations

A notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations A notion of for Convex, Semidefinite and Extended Formulations Marcel de Carli Silva Levent Tunçel April 26, 2018 A vector in R n is integral if each of its components is an integer, A vector in R n is

More information

Strong duality in Lasserre s hierarchy for polynomial optimization

Strong duality in Lasserre s hierarchy for polynomial optimization Strong duality in Lasserre s hierarchy for polynomial optimization arxiv:1405.7334v1 [math.oc] 28 May 2014 Cédric Josz 1,2, Didier Henrion 3,4,5 Draft of January 24, 2018 Abstract A polynomial optimization

More information

1 Strict local optimality in unconstrained optimization

1 Strict local optimality in unconstrained optimization ORF 53 Lecture 14 Spring 016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Thursday, April 14, 016 When in doubt on the accuracy of these notes, please cross check with the instructor s

More information

Semialgebraic Relaxations using Moment-SOS Hierarchies

Semialgebraic Relaxations using Moment-SOS Hierarchies Semialgebraic Relaxations using Moment-SOS Hierarchies Victor Magron, Postdoc LAAS-CNRS 17 September 2014 SIERRA Seminar Laboratoire d Informatique de l Ecole Normale Superieure y b sin( par + b) b 1 1

More information

Analysis and synthesis: a complexity perspective

Analysis and synthesis: a complexity perspective Analysis and synthesis: a complexity perspective Pablo A. Parrilo ETH ZürichZ control.ee.ethz.ch/~parrilo Outline System analysis/design Formal and informal methods SOS/SDP techniques and applications

More information

POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS

POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS Sercan Yıldız syildiz@samsi.info in collaboration with Dávid Papp (NCSU) OPT Transition Workshop May 02, 2017 OUTLINE Polynomial optimization and

More information