Optimization over Polynomials with Sums of Squares and Moment Matrices
|
|
- George Ross
- 5 years ago
- Views:
Transcription
1 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 Konstanz, October 2009 Optimization over Polynomials with Sums of Squares and Moment Matrices p.
2 Polynomial optimization problem (P) Minimize a polynomial function p over a basic closed semi-algebraic set K p min := inf x K p(x) where K := {x R n h 1 (x) 0,..., h m (x) 0} p, h 1,..., h m R[x] are multivariate polynomials Optimization over Polynomials with Sums of Squares and Moment Matrices p.
3 Unconstrained polynomial minimization: K = R n p min := inf x R n p(x) p min 0 p 0 on R n Example: The partition problem. A sequence a 1,..., a n N can be partitioned if i I a i = i [n]\i a i for some I [n], i.e. if p min = 0, where p(x) = ( n i=1 a ix i ) 2 + n i=1 (x2 i 1)2 E.g., the sequence 1, 1, 2, 2, 3, 4, 5 can be partitioned. NP-complete problem Optimization over Polynomials with Sums of Squares and Moment Matrices p.
4 Example: Testing matrix copositivity M R n n is copositive if x T Mx 0 x R n + i.e. if p min = 0, where p(x) = n i,j=1 M ijx 2 i x2 j co-np-complete problem C A = C A C A is copositive B A is copositive Optimization over Polynomials with Sums of Squares and Moment Matrices p.
5 0/1 Linear programming min c T x s.t. Ax b, x 2 i = x i (i = 1,..., n) Example: The stability number α(g) of a graph G = (V, E) can be computed via any of the programs: α(g) = max i V x i s.t. x i +x j 1 (ij E), x 2 i = x i (i V ) 1 α(g) = min xt (I + A G )x s.t. i V x i = 1, x i 0 (i V ) (P) is NP-hard for linear objective and quadratic constraints, or for quadratic objective and linear constraints Optimization over Polynomials with Sums of Squares and Moment Matrices p.
6 Strategy Approximate (P) by a hierarchy of convex (semidefinite) relaxations Shor (1987), Nesterov, Lasserre, Parrilo (2000-) Such relaxations can be constructed using representations of nonnegative polynomials as sums of squares of polynomials and the dual theory of moments Optimization over Polynomials with Sums of Squares and Moment Matrices p.
7 Underlying paradigm Testing whether a polynomial p is nonnegative is hard but one can test whether p is a sum of squares of polynomials efficiently via semidefinite programming Optimization over Polynomials with Sums of Squares and Moment Matrices p.
8 Plan of the talk Role of semidefinite programming in sums of squares SOS/Moment relaxations for (P) Main properties: (1) Asymptotic/finite convergence via SOS representation results for positive polynomials (2) Optimality criterion via results for the moment problem (3) Extract global minimizers by solving polynomial equations Application to unconstrained polynomial optimization Optimization over Polynomials with Sums of Squares and Moment Matrices p.
9 A beautiful monograph about positive polynomials... Alexander Prestel Charles N. Delzell Positive Polynomials From Hilbert s 17th Problem to Real Algebra Optimization over Polynomials with Sums of Squares and Moment Matrices p.
10 Some notation R[x] = R[x 1,..., x n ]: ring of polynomials in n variables R[x] d : all polynomials with degree d p R[x] d p(x) = α N n α d p α x α 1 1 xα n }{{ n} x α = α N n α d p α x α p(x) = p T [x] d after setting and p = (p α ) α : vector of coefficients [x] d = (x α ) α : vector of monomials Optimization over Polynomials with Sums of Squares and Moment Matrices p. 1
11 What is semidefinite programming? Semidefinite programming (SDP) is linear optimization over the cone of positive semidefinite matrices LP SDP vector variable matrix variable x R n X Sym n [symmetric matrix] x 0 X 0 [positive semidefinite] sup X C, X s.t. A j, X = b j (j = 1,..., m) X 0 There are efficient algorithms to solve semidefinite programs Optimization over Polynomials with Sums of Squares and Moment Matrices p. 1
12 A small example of SDP max (X 13 + X 31 )/2 such that X 0, X R 3 3 X 11 = 1, X 12 = 1 X 23 = 1, X 33 = 2 2X 13 + X 22 = 3 max c such that X = 1 1 c 1 3 2c 1 0 c 1 2 One can check that max c = 1 and min c = 1 Optimization over Polynomials with Sums of Squares and Moment Matrices p. 1
13 The Gram-matrix method to recognize sums of squares [cf. Powers-Wörmann 1998] Write p(x) = α 2d p αx α R[x] 2d as a sum of squares: p(x) = k j=1 (u j(x)) 2 = k j=1 [x]t d u j u j T [x] d = [x] d ( k = α 2d j=1 u j u j T } {{ } =: U 0 x α( β, γ d β+γ=α )[x] d = U β,γ }{{} =p α ) β, γ d x β x γ U β,γ Optimization over Polynomials with Sums of Squares and Moment Matrices p. 1
14 Recognize sums of squares via SDP p(x) = α 2d p α x α is a sum of squares of polynomials The following semidefinite program is feasible: β, γ d β+γ=α U 0 U β,γ = p α ( α 2d) Optimization over Polynomials with Sums of Squares and Moment Matrices p. 1
15 Example: Is p = x 4 + 2x 3 y + 3x 2 y 2 + 2xy 3 + 2y 4 SOS? Solution: Try to write p(x, y) (x 2 xy y 2 ) Equating coefficients: a b c b d e c e f }{{} U x 2 xy with U 0 y 2 x 4 = x 2 x 2 x 3 y = x 2 xy x 2 y 2 = xy xy = x 2 y 2 xy 3 = xy y 2 y 4 = y 2 y 2 1 = a 2 = 2b 3 = d + 2c 2 = 2e 2 = f Optimization over Polynomials with Sums of Squares and Moment Matrices p. 1
16 Example continued 1 1 c Hence U = 1 3 2c c 1 c ( ) For c = 1, U = p = (x 2 + xy y 2 ) 2 + (y 2 + 2xy) For c = 0, U = p = (x 2 + xy) (xy + y2 ) (xy y2 ) 2 2 Optimization over Polynomials with Sums of Squares and Moment Matrices p. 1
17 Which nonnegative polynomials are SOS? Hilbert [1888] classified the pairs (n, d) for which every nonnegative polynomial of degree d in n variables is SOS: n = 1 d = 2 n = 2, d = 4 Σ n,d P n,d for all other (n, d) Motzkin polynomial: x 4 y 2 + x 2 y 4 3x 2 y lies in P 2,6 \ Σ 2,6 Optimization over Polynomials with Sums of Squares and Moment Matrices p. 1
18 How many nonnegative polynomials are sums of squares? [Blekherman 2003]: Very few! At fixed degree 2d and large number n of variables, there are significantly more nonnegative polynomials than sums of squares: c n d 1 2 ( vol( Pn,2d ) vol( Σ n,2d ) ) 1 D C n d 1 2 P n,2d := {p P n,2d p homogeneous, deg(p) = 2d, S p(x)µ(dx) = 1} n 1 D := ( n+2d 1 2d ) 1, the dimension of the ambient space Optimization over Polynomials with Sums of Squares and Moment Matrices p. 1
19 How many nonnegative polynomials are sums of squares? Many! The SOS cone is dense in the cone of nonnegative polynomials (allowing variable degrees): [Lasserre 2004]: If p 0 on R n, then ǫ > 0 k N s.t. p + ǫ ( k h=0 n i=1 x 2h i h! ) is SOS [Lasserre-Netzer 2006]: If p 0 on [ 1, 1] n, then ǫ > 0 k N s.t. p + ǫ ( 1 + n i=1 x 2k i ) is SOS Optimization over Polynomials with Sums of Squares and Moment Matrices p. 1
20 Artin [1927] solved Hilbert s 17th problem [1900] ( pi ) 2, where p i, q i R[x] p 0 on R n = p = i q i That is, p q 2 is SOS for some q R[x] Sometimes, the shape of the common denominator is known: Pólya [1928] + Reznick [1995]: For p homogeneous p > 0 on R n \ {0} = p ( n i=1 x 2 i ) r SOS for some r N Optimization over Polynomials with Sums of Squares and Moment Matrices p. 2
21 An example [Parrilo 2000] M := p is not SOS p := But ( 5 i=1 x2 i )p is SOS 5 i,j=1 M ij x 2 i x2 j This is a certificate that p 0 on R 5, i.e., that M is copositive Optimization over Polynomials with Sums of Squares and Moment Matrices p. 2
22 SOS certificates for positivity on a semi-algebraic set K Let K = {x R n h 1 (x) 0,..., h m (x) 0} Set h 0 := 1 Quadratic module: M(h) := Preordering: T(h) := { m j=0 s j h j s j Σ n } { } s e h e1 1 he m m s e Σ n e {0,1} m p M(h) = p T(h) = p 0 on K Optimization over Polynomials with Sums of Squares and Moment Matrices p. 2
23 The Positivstellensatz [Krivine 1964] [Stengle 1974] Not an equivalence: K = {x R (1 x 2 ) 3 0} p = 1 x 2 Then, p 0 on K, but p T(h) The Positivstellensatz characterizes equivalence: p 0 on K pf = p 2m + g for some f, g T(h) and some m N But this does not yield tractable relaxations for (P)! Optimization over Polynomials with Sums of Squares and Moment Matrices p. 2
24 The Positivstellensatz [Krivine 1964] [Stengle 1974] K = {x R n h 1 (x) 0,..., h m (x) 0} (1) p > 0 on K pf = 1 + g for some f, g T(h) (2) p 0 on K pf = p 2m + g for some f, g T(h), m N (3) p = 0 on K p 2m T(h) for some m N (2) = solution to Hilbert s 17th problem (3) = Real Nullstellensatz But this does not yield tractable relaxations for (P)!!! Optimization over Polynomials with Sums of Squares and Moment Matrices p. 2
25 SOS certificates of positivity on K compact Schmüdgen [1991]: Assume K is compact. p > 0 on K = p T(h) Putinar [1993]: Assume the following Archimedean condition holds: (A) p R[x] N N N ± p M(h) Equivalently: N N N n i=1 x2 i M(h) p > 0 on K = p M(h) Optimization over Polynomials with Sums of Squares and Moment Matrices p. 2
26 SOS relaxations for (P) [Lasserre 2001, Parrilo 2000] p min = inf x K p(x) = sup λ s.t. p λ 0 on K Relax p λ 0 on K [hard condition] by p λ M(h) [SOS but unbounded degrees...] by p λ M(h) 2t [tractable SDP!] { m } M(h) 2t := j=0 s jh j s j Σ n, deg(s j h j ) 2t Relaxation (SOSt): p sos t := sup λ s.t. p λ M(h) 2t p sos t+1 p min Optimization over Polynomials with Sums of Squares and Moment Matrices p. 2
27 Asymptotic convergence If (A) holds for K, then lim p sos t t = p min Proof: p p min + ǫ > 0 on K = t p p min + ǫ M(h) 2t = p sos t p min ǫ Note: A representation result valid for p 0 on K" gives finite convergence: p sos t = p min for some t [Nie-Schweighofer 2007]: p min p sos t where c = c(h) and c = c(p, h) c c log(t/c) for t big, Optimization over Polynomials with Sums of Squares and Moment Matrices p. 2
28 Dual moment relaxations for (P) [Lasserre 2001] min = inf x K p(x)= inf µ probability measure on K K p(x)dµ(x) = inf L R[x] L(p) s.t. L comes from a probability measure µ on K = inf L R[x] L(p) s.t. L(f) 0 f 0 on K [Haviland] The following are equivalent for L R[x] : L comes from a nonnegative measure on K, i.e., L(f) = K f(x)dµ(x) f R[x] L(p) 0 if p 0 on K Optimization over Polynomials with Sums of Squares and Moment Matrices p. 2
29 Dual moment relaxations for (P) [continued] p min = inf L R[x] L(p) s.t. L(f) 0 f 0 on K Relax by by L(f) 0 f 0 on K L(f) 0 f M(h) L(f) 0 f M(h) 2t Relaxation (MOMt): p mom t := inf L R[x] 2t L(p) s.t. L 0 on M(h) 2t Weak duality: p sos t p mom t p min Equality: p sos t = p mom t e.g. if int(k) Optimization over Polynomials with Sums of Squares and Moment Matrices p. 2
30 The dual relaxation (MOMt) is again an SDP L R[x] 2t M t(l) := (L(x α x β )) α, β t M t (L) is the moment matrix of L (of order t) Lemma: L(f 2 ) 0 f R[x] t M t (L) 0 Proof: L(f 2 ) = f T M t (L) f Can express L 0 on M(h) 2t, i.e., L(f 2 h j ) 0 f j with deg(f 2 h j ) 2t as SDP conditions Optimization over Polynomials with Sums of Squares and Moment Matrices p. 3
31 Optimality criterion Observation: Let L be an optimum solution to (MOMt). If L comes from a probability measure µ on K, then (MOMt) is exact: p mom t = p min. Question: How to recognize whether L has a representing measure on K? Next: Sufficient condition of Curto-Fialkow for the moment problem Optimization over Polynomials with Sums of Squares and Moment Matrices p. 3
32 A sufficient condition for the moment problem Theorem [Curto-Fialkow 1996] Let L R[x] 2t. If M t (L) 0 and (RC) rankm t (L) = rankm t 1 (L), then L has a representing measure. Corollary [Curto-Fialkow 2000] + [Henrion-Lasserre 2005] Set d := max j deg(h j )/2. Let L be an optimum solution to (MOMt) satisfying rankm t (L) = rankm t d (L). Then, p mom t = p min and V (KerM t (L)) { global minimizers of p on K} with equality if rankm t (L) is maximum. Optimization over Polynomials with Sums of Squares and Moment Matrices p. 3
33 Remarks Compute V (KerM t (L)) with the eigenvalue method. If the rank condition holds at a maximum rank solution, then (P) has finitely many global minimizers. But the reverse is not true! The rank condition holds in the finite variety case: K = {x R n h 1 (x) = 0,..., h k (x) = 0, h }{{} k+1 (x) 0,...} ideal I with V R (I) < Optimization over Polynomials with Sums of Squares and Moment Matrices p. 3
34 Finite convergence in the finite variety case K = {x R n h 1 (x) = 0,..., h k (x) = 0, h }{{} k+1 (x) 0,...} ideal I Theorem: [La 2002] [Lasserre/La/Rostalski 2007] (i) If V C (I) <, p sos t = p mom t = p min for some t (ii) If V R (I) <, p mom t = p min for some t Optimization over Polynomials with Sums of Squares and Moment Matrices p. 3
35 The flat extension theorem Theorem [Curto-Fialkow 1996] Let L R[x] 2t. If rank M t (L) = rank M t 1 (L), then there is an extension L R[x] of L for which rank M( L) = rank M t (L). Main tool: KerM( L) is an ideal. [La-Mourrain 2009] The flat extension theorem can be generalized to matrices indexed by a set C of monomials (connected to 1) and its closure C + = C x 1 C... x n C, satisfying rank M C = rank M C +. Optimization over Polynomials with Sums of Squares and Moment Matrices p. 3
36 The finite rank moment matrix theorem Theorem: [Curto-Fialkow 1996] Let L R[x]. M(L) 0 and rank M(L) =: r < L has a (unique) r-atomic representation measure µ. [La 2005] Simple proof for = : I := KerM(L) is a real radical ideal I is 0-dimensional, as dim R[x]/I = r Hence: V (I) = {x 1,..., x r } R n Verify: L is represented by µ = r i=1 L(p2 i )δ x i, where the p i s are interpolation polynomials at the x i s Optimization over Polynomials with Sums of Squares and Moment Matrices p. 3
37 Implementations of the SOS/moment relaxation method GloptiPoly by Henrion, Lasserre (incorporates the optimality stopping criterion and the extraction procedure for global minimizers) SOSTOOLS by Prajna, Papachristodoulou, Seiler, Parrilo YALMIP by Löfberg SparsePOP by Waki, Kim, Kojima, Muramatsu Optimization over Polynomials with Sums of Squares and Moment Matrices p. 3
38 Example 1 min p = 25(x 1 2) 2 (x 2 2) 2 (x 3 1) 2 (x 4 4) 2 (x 5 1) 2 (x 6 4) 2 s.t. (x 3 3) 2 + x 4 4, (x 5 3) 2 + x 6 4 x 1 3x 2 2, x 1 + x 2 2, x 1 + x 2 6, x 1 + x 2 2, 1 x 3 5, 0 x 4 6, 1 x 5 5, 0 x 6 10, x 1, x 2 0 order t rank sequence bound p mom t solution extracted unbounded none (5, 1, 5, 0, 5, 10) d = 1 The global minimum is found at the relaxation of order t = 2 Optimization over Polynomials with Sums of Squares and Moment Matrices p. 3
39 Example 2 min p = x 1 x 2 s.t. x 2 2x 4 1 8x x x 2 4x x x2 1 96x x 1 3, 0 x 2 4 order t rank sequence bound p mom t solution extracted none none (2.3295, ) d = 2 The global minimum is found at the relaxation of order t = 4 Optimization over Polynomials with Sums of Squares and Moment Matrices p. 3
40 An example where (RC) cannot hold Perturbed Motzkin form: p = x 2 1 x2 2 (x2 1 + x2 2 3x2 3 ) + x6 3 + ǫ(x6 1 + x6 2 + x6 3 ) K = {x 3 i=1 x2 i But (RC) never holds 1} (0, 0) is the unique minimizer as p M(h) and p sos t = p mom t < p min = 0 order t rank sequence bound p mom t val. moment vect d = 3, ǫ = 0.01 Optimization over Polynomials with Sums of Squares and Moment Matrices p. 4
41 Application to Unconstrained Polynomial Minimization p min = inf x R n p(x) where deg(p) = 2d As there is no constraint, the relaxation scheme just gives one bound: p sos t = p mom t = p sos d = pmom d p min for all t d with equality iff p(x) p min is SOS How to get better bounds? Optimization over Polynomials with Sums of Squares and Moment Matrices p. 4
42 Idea: Transform the Unconstrained Problem into a Constrained Problem If p has a minimum: p min =p grad := inf x V R grad p(x) where V R grad := {x Rn p(x) = 0 (i = 1,..., n)} If, moreover, a bound R is known on the norm of a global minimizer: p min =p ball := inf R 2 P i x2 i 0 p(x) Optimization over Polynomials with Sums of Squares and Moment Matrices p. 4
43 When p attains its minimum The ball approach : Convergence of the SOS/MOM bounds to p min = p ball The gradient variety approach: [Demmel, Nie, Sturmfels 2004]: p > 0 on V R grad = p M grad p 0 on V R grad = p M grad if I grad radical M grad := M(± p/ x i ) = Σ n + n i=1 R[x] p/ x i } {{ } I grad Optimization over Polynomials with Sums of Squares and Moment Matrices p. 4
44 Convergence Result [Demmel, Nie, Sturmfels 2004] Asymptotic convergence of the SOS/MOM bounds to p grad Finite Convergence to p grad when the gradient ideal I grad is radical Hence: When p attains its minimum, we have a converging hierarchy of SDP bounds to p min Example: p = x 2 + (xy 1) 2 does not attain its minimum p min = 0 < p grad = 1 Optimization over Polynomials with Sums of Squares and Moment Matrices p. 4
45 What if p is not known to have a minimum? Strategy 1: Perturb the polynomial p [Hanzon-Jibetean 2003] [Jibetean-Laurent 2004] ( n ) p ǫ (x) := p(x) + ǫ x 2d+2 i for small ǫ > 0 i=1 p ǫ has a minimum and lim ǫ 0 (p ǫ ) min = p min The global minimizers of p ǫ converge to global minimizers of p as ǫ 0 The gradient variety of p ǫ is finite finite convergence of (p ǫ ) sos t, (p ǫ ) mom t to (p ǫ ) min Optimization over Polynomials with Sums of Squares and Moment Matrices p. 4
46 Example: Perturb the polynomial p = (xy 1) 2 + x 2 inf p(x) s.t. p ǫ / x 1 = 0, p ǫ / x 2 = 0 ǫ order t rank sequence p mom t extracted solutions ±(0.4729,1.3981) ±(0.4060,1.9499) ±(0.3287,2.6674) ±(0.2574,3.6085) ±(0.1977,4.8511) ±(0.1503,6.4986) ±(0.1136,8.6882) ±(0.0856, ) ±(0.0643, ) Optimization over Polynomials with Sums of Squares and Moment Matrices p. 4
47 When p does not have a minimum: Algebraic/analytical approach of Schweighofer [2005] Strategy 2: Minimize p over its gradient tentacle If p min >, then p min = inf x K grad p(x) where K grad := {x R n p(x) 2 x 2 1} V R grad p = ( p/ x i ) n i=1 Optimization over Polynomials with Sums of Squares and Moment Matrices p. 4
48 Representation result on the gradient tentacle K grad [Schweighofer 2005]: Assume p min > and p has only isolated singularities at infinity (*) (e.g. n = 2). Then, p 0 on R n p 0 on K grad ǫ > 0 p + ǫ M(1 p(x) 2 x 2 ) Convergent SOS/moment bounds to p min = inf Kgrad p(x) (*): The system p d (x) = 0, p d 1 (x) = 0 has finitely many projective zeros, where p = p d + p d p 0 and p i is the homogeneous component of degree i Tools: Algebra (extension of Schmüdgen s theorem) + analysis (Parusinski s results on behaviour of polynomials at infinity) Optimization over Polynomials with Sums of Squares and Moment Matrices p. 4
49 When p does not have a minimum: The tangency variety approach of Vui-Son [2008] Strategy 3: Minimize p over its truncated tangency variety : ( ) { Γ p := x R n p(x) rank 1} x = {x g ij := x i p/ x j x j p/ x i = 0 i, j n} Γ 0 p := Γ p {x p(x) p(0)} [Vui-Son 2008]: For p R[x] such that p min > p 0 on R n p 0 on Γ 0 p ǫ > 0 p + ǫ M(p(0) p, ±g ij ) Convergent SOS/moment bounds to p min = inf Γ 0 p p(x) Optimization over Polynomials with Sums of Squares and Moment Matrices p. 4
50 Further directions Exploit structure (equations, sparsity, symmetry, convexity,...) to get smaller SDP programs [Kojima, Grimm, Helton, Lasserre, Netzer, Nie, Riener, Schweighofer, Theobald, Parrilo,...] Application to the generalized problem of moments, to approximating integrals over semi-algebraic sets,... [Henrion, Lasserre, Savorgnan,...] Extension to NC variables [Helton, Klep, McCullough, Schmüdgen, Schweighofer,...] Optimization over Polynomials with Sums of Squares and Moment Matrices p. 5
Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry
Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry Rekha R. Thomas University of Washington, Seattle References Monique Laurent, Sums of squares, moment matrices and optimization
More informationOn 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 informationRepresentations 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 informationGlobal Optimization of Polynomials Using Generalized Critical Values and Sums of Squares
Global Optimization of Polynomials Using Generalized Critical Values and Sums of Squares Feng Guo Key Laboratory of Mathematics Mechanization, MSS Beijing 100190, China fguo@mmrc.iss.ac.cn Mohab Safey
More informationThe 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 informationSUMS 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 informationGlobal 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 informationMinimum 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 informationSolving 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 informationSemidefinite 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 informationStrange 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 informationReal 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 informationAn 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 informationDetecting global optimality and extracting solutions in GloptiPoly
Detecting global optimality and extracting solutions in GloptiPoly Didier Henrion 1, Jean-Bernard Lasserre 1 September 5, 5 Abstract GloptiPoly is a Matlab/SeDuMi add-on to build and solve convex linear
More informationHow 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 information6-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 informationThe 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 informationarxiv: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 informationGlobal polynomial optimization with Moments Matrices and Border Basis
Global polynomial optimization with Moments Matrices and Border Basis Marta Abril Bucero, Bernard Mourrain, Philippe Trebuchet Inria Méditerranée, Galaad team Juillet 15-19, 2013 M. Abril-Bucero, B. Mourrain,
More informationAn 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 informationCopositive 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 informationGlobal Optimization with Polynomials
Global Optimization with Polynomials Geoffrey Schiebinger, Stephen Kemmerling Math 301, 2010/2011 March 16, 2011 Geoffrey Schiebinger, Stephen Kemmerling (Math Global 301, 2010/2011) Optimization with
More informationAn Introduction to Polynomial and Semi-Algebraic Optimization
An Introduction to Polynomial and Semi-Algebraic Optimization This is the first comprehensive introduction to the powerful moment approach for solving global optimization problems (and some related problems)
More informationConvergence 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 informationFast ADMM for Sum of Squares Programs Using Partial Orthogonality
Fast ADMM for Sum of Squares Programs Using Partial Orthogonality Antonis Papachristodoulou Department of Engineering Science University of Oxford www.eng.ox.ac.uk/control/sysos antonis@eng.ox.ac.uk with
More informationOptimization 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 informationAdvanced 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 informationNon-commutative polynomial optimization
Non-commutative polynomial optimization S. Pironio 1, M. Navascuès 2, A. Acín 3 1 Laboratoire d Information Quantique (Brussels) 2 Department of Mathematics (Bristol) 3 ICFO-The Institute of Photonic Sciences
More informationGlobal 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 informationApproximate GCDs of polynomials and sparse SOS relaxations
Approximate GCDs of polynomials and sparse SOS relaxations Bin Li a, Jiawang Nie b Lihong Zhi a a Key Lab of Mathematics Mechanization, AMSS, Beijing 100190 China b Department of Mathematics, UCSD, La
More informationon 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 informationThe 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 informationSemidefinite 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 informationRobust 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 informationA 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 informationSemidefinite 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 informationConvex 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 informationRanks 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 informationA Sparse Flat Extension Theorem for Moment Matrices
A Sparse Flat Extension Theorem for Moment Matrices Monique Laurent and Bernard Mourrain Abstract. In this note we prove a generalization of the flat extension theorem of Curto and Fialkow [4] for truncated
More informationRational 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 informationCopositive 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 informationStrong 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 informationA 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 informationApproximate 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 informationExact 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 informationCONVEXITY 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 informationSolving systems of polynomial equations and minimization of multivariate polynomials
François Glineur, Polynomial solving & minimization - 1 - First Prev Next Last Full Screen Quit Solving systems of polynomial equations and minimization of multivariate polynomials François Glineur UCL/CORE
More informationCroatian Operational Research Review (CRORR), Vol. 3, 2012
126 127 128 129 130 131 132 133 REFERENCES [BM03] S. Burer and R.D.C. Monteiro (2003), A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Mathematical Programming
More informationReal Symmetric Matrices and Semidefinite Programming
Real Symmetric Matrices and Semidefinite Programming Tatsiana Maskalevich Abstract Symmetric real matrices attain an important property stating that all their eigenvalues are real. This gives rise to many
More informationPOLYNOMIAL 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 informationConvex 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 informationSemidefinite 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 informationConvex 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 informationA new approximation hierarchy for polynomial conic optimization
A new approximation hierarchy for polynomial conic optimization Peter J.C. Dickinson Janez Povh July 11, 2018 Abstract In this paper we consider polynomial conic optimization problems, where the feasible
More informationMoments 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 informationSEMIDEFINITE PROGRAMMING VS. LP RELAXATIONS FOR POLYNOMIAL PROGRAMMING
MATHEMATICS OF OPERATIONS RESEARCH Vol. 27, No. 2, May 2002, pp. 347 360 Printed in U.S.A. SEMIDEFINITE PROGRAMMING VS. LP RELAXATIONS FOR POLYNOMIAL PROGRAMMING JEAN B. LASSERRE We consider the global
More informationConvex 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 informationOn 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 informationSemi-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 informationarxiv: v1 [math.oc] 6 Mar 2009
A convex polynomial that is not sos-convex Amir Ali Ahmadi and Pablo A. Parrilo arxiv:090.87v1 [math.oc] 6 Mar 2009 Abstract A multivariate polynomial p(x) = p(x 1,...,x n ) is sos-convex if its Hessian
More informationA positive definite polynomial Hessian that does not factor
A positive definite polynomial Hessian that does not factor The MIT Faculty has made this article openly available Please share how this access benefits you Your story matters Citation As Published Publisher
More informationarxiv: 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 informationLift-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 informationPOSITIVITY 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 informationNon-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 informationMoments 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 informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-2804 Research Reports on Mathematical and Computing Sciences Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity Hayato Waki,
More informationComparison 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 informationCompletely 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 informationSemidefinite 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 informationarxiv: 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 informationTheoretical Computer Science. Computing sum of squares decompositions with rational coefficients
Theoretical Computer Science 409 (2008) 269 281 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Computing sum of squares decompositions
More informationAnalysis 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 information4. 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 informationRegular 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 informationGlobal 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 informationResearch overview. Seminar September 4, Lehigh University Department of Industrial & Systems Engineering. Research overview.
Research overview Lehigh University Department of Industrial & Systems Engineering COR@L Seminar September 4, 2008 1 Duality without regularity condition Duality in non-exact arithmetic 2 interior point
More informationSum 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 informationIntroduction 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 informationMTNS 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 informationMatricial 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 informationLMI 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 informationOptimization 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 informationDescribing 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 informationNetwork Utility Maximization With Nonconcave Utilities Using Sum-of-Squares Method
Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 2005 Seville, Spain, December 2-5, 2005 MoC4.6 Network Utility Maximization With Nonconcave Utilities
More informationA General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones
Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo
More informationarxiv: 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 informationA NICHTNEGATIVSTELLENSATZ FOR POLYNOMIALS IN NONCOMMUTING VARIABLES
A NICHTNEGATIVSTELLENSATZ FOR POLYNOMIALS IN NONCOMMUTING VARIABLES IGOR KLEP AND MARKUS SCHWEIGHOFER Abstract. Let S {f} be a set of symmetric polynomials in noncommuting variables. If f satisfies a polynomial
More informationChapter 2 The Approach of Moments for Polynomial Equations
Chapter 2 The Approach of Moments for Polynomial Equations Monique Laurent and Philipp Rostalski 2.1 Introduction Computing all points x K n (K = R or C) at which a given system of polynomials in n variables
More informationAlgebraic Optimization with Applications to System Theory
VRIJE UNIVERSITEIT Algebraic Optimization with Applications to System Theory ACADEMISCH PROEFSCHRIFT ter verkrijging van de graad van doctor aan de Vrije Universiteit Amsterdam, op gezag van de rector
More informationDimension reduction for semidefinite programming
1 / 22 Dimension reduction for semidefinite programming Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
More informationLarge 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 informationSPECTRAHEDRA. 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 informationCOURSE 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 informationGlobally convergent algorithms for PARAFAC with semi-definite programming
Globally convergent algorithms for PARAFAC with semi-definite programming Lek-Heng Lim 6th ERCIM Workshop on Matrix Computations and Statistics Copenhagen, Denmark April 1 3, 2005 Thanks: Vin de Silva,
More informationComplexity 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 informationSemidefinite 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 informationLecture 6 Verification of Hybrid Systems
Lecture 6 Verification of Hybrid Systems Ufuk Topcu Nok Wongpiromsarn Richard M. Murray AFRL, 25 April 2012 Outline: A hybrid system model Finite-state abstractions and use of model checking Deductive
More informationCLOSURES 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 information5. Duality. Lagrangian
5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized
More information