Global polynomial optimization with Moments Matrices and Border Basis
|
|
- Warren Jefferson
- 5 years ago
- Views:
Transcription
1 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, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
2 Our Problem inf x Rnf (x) s.t. g 1 (x) = = g n1 (x) = 0 h 1 (x) 0,..., h n2 (x) 0 (1) where S = {x R n g 1 (x) = = g n1 (x) = 0, h 1 (x) 0,..., h n2 (x) 0} and H = {h 1,..., h n2 }. M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
3 Our Objectives 1 Show that the hierarchy of relaxation problems is exact.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
4 Our Objectives 1 Show that the hierarchy of relaxation problems is exact. 2 Find a criterion to detect when the optimum is reached and show that this criterion is eventually satised.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
5 Our Objectives 1 Show that the hierarchy of relaxation problems is exact. 2 Find a criterion to detect when the optimum is reached and show that this criterion is eventually satised. 3 When this criterion is satised, recover all the points where this optimum is achieved.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
6 Related works First work Global optimization with polynomials and the problem of the moments - J.B. Lasserre. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
7 Related works First work Global optimization with polynomials and the problem of the moments - J.B. Lasserre Finite convergence SemiDenite Representation for nite varieties - M. Laurent - V(G) nite Minimizing polynomials via sum of squares over gradient ideal - Nie, Demmel, Sturmfels - Gradient ideal is radical Representations of non-negatives polynomials via critical, degree bounds and applications to optimization - M. Marshall - BHC Representation of positive polynomials on non-compact semialgebraic sets via KKT ideals - Demmel, Nie, Powers - KKT ideal is radical An exact Jacobian Sdp Relaxation - Nie - regularity conditions. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
8 Related works First work Global optimization with polynomials and the problem of the moments - J.B. Lasserre Finite convergence SemiDenite Representation for nite varieties - M. Laurent - V(G) nite Minimizing polynomials via sum of squares over gradient ideal - Nie, Demmel, Sturmfels - Gradient ideal is radical Representations of non-negatives polynomials via critical, degree bounds and applications to optimization - M. Marshall - BHC Representation of positive polynomials on non-compact semialgebraic sets via KKT ideals - Demmel, Nie, Powers - KKT ideal is radical An exact Jacobian Sdp Relaxation - Nie - regularity conditions Convergence certicate Certifying convergence via Flat truncation - Nie. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
9 Related works First work Global optimization with polynomials and the problem of the moments - J.B. Lasserre Finite convergence SemiDenite Representation for nite varieties - M. Laurent - V(G) nite Minimizing polynomials via sum of squares over gradient ideal - Nie, Demmel, Sturmfels - Gradient ideal is radical Representations of non-negatives polynomials via critical, degree bounds and applications to optimization - M. Marshall - BHC Representation of positive polynomials on non-compact semialgebraic sets via KKT ideals - Demmel, Nie, Powers - KKT ideal is radical An exact Jacobian Sdp Relaxation - Nie - regularity conditions Convergence certicate Certifying convergence via Flat truncation - Nie How to recover the minimizer ideal Real Radical Computation - Lasserre, Laurent, Mourrain, Trebuchet M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
10 Gradient Variety With Lagrange Multipliers: inf (x,u,v,s)=z R n+n 1 +2 n 2 f (x) where F (x, u, v, s) = f (x) P n1 i=1 u i g i (x) P n2 j=1 v j (h j (x) s 2 j ), u = (u 1,..., u n 1 ), v = (v 1,..., v n 2 ) and s = (s 1,..., s n 2 ). Denition s.t. F (x, u, v, s) = 0 (2) I grad = ( F (z)) = (F 1,..., F n, g 1,..., g n 1, h 1 s 2 1,..., hn 2 s2 n2, v 1s 1,..., v n 2 sn 2 ) R[z] V grad = V(I grad ) C n+n 1+2n2 M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
11 KKT Variety inf (x,u,v)=y R n+n 1 +n 2 f (x) s.t. F 1 = = F n = 0 g 1 = = g n 1 = 0 v 1 h 1 = = v n 2 hn 2 = 0 h 1 0,..., h n 2 0 (3) where F i = f P n1 x i j=1 u g j j x i P n2 j=1 v h j j. x i Denition x is a KKT point if there exists u 1,..., u n 1, v 1,..., v n 2 R s.t. n1x n2x f (x ) u i g i (x ) v i h i (x ) = 0, g i (x ) = 0, v i h i (x ) = 0 i=1 S KKT = set of KKT point of S. j=0 A KKT-minimizer of f on S is a point x S KKT such that f (x ) = min x S KKT f (x). I KKT = (F 1,..., F n, g 1,..., g n 1, v 1h 1,..., v n 2 hn 2 ) R[y]. V KKT = V(I KKT ) C n+n 1+n2 M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
12 Minimizer Variety Denition V min = {z R n+n 1+2 n 2 I min = I(V min ) s.t F (z ) = 0 and f (x ) is minimum}. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
13 Minimizer Variety Denition V min = {z R n+n 1+2 n 2 I min = I(V min ) s.t F (z ) = 0 and f (x ) is minimum} Proposition V R KKT W +(H) = π y (V R grad ), W +(H) = {y R n h(x) 0 h H}. I KKT = I grad R[y] = I y grad. M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
14 Our contributions When f is reached in a KKT-minimizer of f on S. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
15 Our contributions When f is reached in a KKT-minimizer of f on S Hierarchy of relaxations problem asociated to problem 3 or to its projection is exact.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
16 Our contributions When f is reached in a KKT-minimizer of f on S Hierarchy of relaxations problem asociated to problem 3 or to its projection is exact. When f is attained we nd the generators of I min.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
17 Our contributions When f is reached in a KKT-minimizer of f on S Hierarchy of relaxations problem asociated to problem 3 or to its projection is exact. When f is attained we nd the generators of I min. New representation of positive polynomials on S.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
18 Our contributions When f is reached in a KKT-minimizer of f on S Hierarchy of relaxations problem asociated to problem 3 or to its projection is exact. When f is attained we nd the generators of I min. New representation of positive polynomials on S. And if V min is nite we propose:. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
19 Our contributions When f is reached in a KKT-minimizer of f on S Hierarchy of relaxations problem asociated to problem 3 or to its projection is exact. When f is attained we nd the generators of I min. New representation of positive polynomials on S. And if V min is nite we propose: New criterion for deciding when the minimum is reached.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
20 Our contributions When f is reached in a KKT-minimizer of f on S Hierarchy of relaxations problem asociated to problem 3 or to its projection is exact. When f is attained we nd the generators of I min. New representation of positive polynomials on S. And if V min is nite we propose: New criterion for deciding when the minimum is reached. Satised Certicate for high degree. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
21 Our contributions When f is reached in a KKT-minimizer of f on S Hierarchy of relaxations problem asociated to problem 3 or to its projection is exact. When f is attained we nd the generators of I min. New representation of positive polynomials on S. And if V min is nite we propose: New criterion for deciding when the minimum is reached. Satised Certicate for high degree New algorithm to nd the minimizer ideal of a real polynomial function on S.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
22 Our contributions When f is reached in a KKT-minimizer of f on S Hierarchy of relaxations problem asociated to problem 3 or to its projection is exact. When f is attained we nd the generators of I min. New representation of positive polynomials on S. And if V min is nite we propose: New criterion for deciding when the minimum is reached. Satised Certicate for high degree New algorithm to nd the minimizer ideal of a real polynomial function on S. Reduction of the size of SDP problems for using border basis.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
23 Our contributions When f is reached in a KKT-minimizer of f on S Hierarchy of relaxations problem asociated to problem 3 or to its projection is exact. When f is attained we nd the generators of I min. New representation of positive polynomials on S. And if V min is nite we propose: New criterion for deciding when the minimum is reached. Satised Certicate for high degree New algorithm to nd the minimizer ideal of a real polynomial function on S. Reduction of the size of SDP problems for using border basis.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
24 Hierarchy of relaxation problems Denition Given a vector space E R[y] with 1 E, and nite subsets G, H R[y], we dene P E,H = { P ɛ {0,1} n 2 sɛ hɛ 1 1 hɛn 2 n2 s ɛ P E 2, s ɛ h ɛ 1 1 hɛn 2 n2 E E }. P E,G,H := {g + q g G E E, q P E,H } L E,G,H := {Λ E E Λ(p) 0, p P E,G,H } f µ E,G,H = inf {Λ(f ) s.t. Λ L E,G,H, Λ(1) = 1} f sos E,G,H = max {γ s.t. f γ P E,G,H} f = inf x S KKT f (x).. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
25 Hierarchy of relaxation problems Denition Given a vector space E R[y] with 1 E, and nite subsets G, H R[y], we dene P E,H = { P ɛ {0,1} n 2 sɛ hɛ 1 1 hɛn 2 n2 s ɛ P E 2, s ɛ h ɛ 1 1 hɛn 2 n2 E E }. P E,G,H := {g + q g G E E, q P E,H } L E,G,H := {Λ E E Λ(p) 0, p P E,G,H } f µ E,G,H = inf {Λ(f ) s.t. Λ L E,G,H, Λ(1) = 1} f sos E,G,H = max {γ s.t. f γ P E,G,H} f = inf x S KKT f (x). Hierarchy For t N, consider the prolongation G 2t of G to degree 2t and E = R[y] t L t+1,g,h L t,g,h and P t,g,h P t+1,g,h Properties If V y min 0 and V y min V R (G) W +(H), f µ t,g,h f µ t+1,g,h f and f sos t,g,h f sos t+1,g,h f and f sos t,g,h f µ t,g,h f M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
26 Truncated Hankel operators and Generic linear form Denition Let E R[x] be a vector space and let Λ E E be a linear form, the map MΛ E : E E by MΛ E (p) = p Λ for p E is a truncated Hankel operator. ker MΛ E = {p E p Λ = 0, i.e, Λ(pq) = 0 q E} The matrix MΛ E is the Moment Matrix: [ME Λ ] = (Λ(xα+β )) α E,β E. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
27 Truncated Hankel operators and Generic linear form Denition Let E R[x] be a vector space and let Λ E E be a linear form, the map MΛ E : E E by MΛ E (p) = p Λ for p E is a truncated Hankel operator. ker MΛ E = {p E p Λ = 0, i.e, Λ(pq) = 0 q E} The matrix MΛ E is the Moment Matrix: [ME Λ ] = (Λ(xα+β )) α E,β E Denition Λ L E,G,H is generic for f if rankm E Λ = max Λ LE,G,H,Λ(f )=f µ E,G,H rankm E Λ. How to nd Λ L E,G,H generic for f? Solve the SDP program with interior point methods. Existing tools: SDPA, CSDP,... M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
28 Representation of positive polynomials Theorem Let f R[x]. 1 If f 0 on S KKT, then f P x H + q I x grad = P x H + p I x KKT. 2 If f > 0 on S KKT, then f P x H + I x grad = P x H + I x KKT.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
29 Representation of positive polynomials Theorem Let f R[x]. 1 If f 0 on S KKT, then f P x H + q I x grad = P x H + p I x KKT. 2 If f > 0 on S KKT, then f P x H + I x grad = P x H + I x KKT. Proposition - Demmel, Nie and Powers 2007 Let f R[x]. 1 If f 0 on S KKT, then f P H + I KKT. 2 If f > 0 on S KKT, then f P H + I KKT.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
30 Representation of positive polynomials Theorem Let f R[x]. 1 If f 0 on S KKT, then f P x H + q I x grad = P x H + p I x KKT. 2 If f > 0 on S KKT, then f P x H + I x grad = P x H + I x KKT. Proposition - Demmel, Nie and Powers 2007 Let f R[x]. 1 If f 0 on S KKT, then f P H + I KKT. 2 If f > 0 on S KKT, then f P H + I KKT. Corollary - Nie, Demmel and Sturmfels 2005 If n 1 = n 2 = 0 then I grad = ( f ) = ( f,..., f ). x 1 xn 1 If f 0 on V R ( f ), then f P x + p ( f ). 2 If f > 0 on V R ( f ), then f P x + ( f ). M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
31 Finite convergence Theorem - Finite Convergence and minimizer ideal For G R[x] with hyp{g, V min } : [V x min V R (G) W + (H) π x (V R KKT ) and V min ], t 2 N s.t. t t 2, for Λ L t,g,h generic for f, we have Λ (f ) = f µ t,g,h = f. (ker M t Λ ) = I x min. If V(G) π x (V KKT ) then f sos t,g,h = f µ t,g,h = f. Similar result for G R[y] with V y min V R (G) W + (H) V R KKT M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
32 Convergence certication and satisfaction Theorem - Convergence Certication Let B be a monomial set connected to 1, E R[x] with (1) f E E, (2) B + E, G B E E, H B B E E and hyp{g, V min } + V min is nite and let Λ L E,G,H generic for f with: (3) rank M E Λ = rank M B Λ = B. Then f = f µ E,G,H = f sos E,G,H (ker M E Λ ) = I x min. B + = B x 1 B x nb Theorem - Satised Certication Let G, H R[x] with hyp{g, V min } + V min is nite. Then, t 3 N s.t. t t 3, and Λ L t,g,h generic for f, a vector space E R[x] t and B connected to 1 such that the properties (1), (2) and (3) of the above theorem are satised. M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
33 Consequences Generic case: Generalization of Nie 2011 A J := [ f, g 1,..., g n 1, h j1,..., h j k ], J = {j 1,..., j k }. V( J 1,..., J ) = {x C n rank(a l J ) n 1 + J }. J G = (g 1,, g n 1, g Q J,i ) with g J,i := J i j J h j for i = 1,..., l J, J [0, n 2 ]. Conclusion: If (g 1,... g n 1 ; h 1,..., h n 2 ) is C-regular ( points x Cn with J(x) = {j 1,..., j k }, g 1 (x),..., g n 1 (x), h j1 (x),..., h j k (x) s. t. h jl (x) = 0 are l. i.) +f reaches its minimum at x S Finite Convergence and minimizer ideal Theorem.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
34 Consequences Generic case: Generalization of Nie 2011 A J := [ f, g 1,..., g n 1, h j1,..., h j k ], J = {j 1,..., j k }. V( J 1,..., J ) = {x C n rank(a l J ) n 1 + J }. J G = (g 1,, g n 1, g Q J,i ) with g J,i := J i j J h j for i = 1,..., l J, J [0, n 2 ]. Conclusion: If (g 1,... g n 1 ; h 1,..., h n 2 ) is C-regular ( points x Cn with J(x) = {j 1,..., j k }, g 1 (x),..., g n 1 (x), h j1 (x),..., h j k (x) s. t. h jl (x) = 0 are l. i.) +f reaches its minimum at x S Finite Convergence and minimizer ideal Theorem. Regular case: Generalization of Ha and Pham 2010 A J := [ f, g 1,..., g n 1, h j1,..., h j k ], J = {j 1,..., j k }. Over R n, J i = J = det(a J A T J ) G = (g 1,, g n 1, g J) with g J := J Qj J h j for i = 1,..., l J, J [0, n 2 ]. Conclusion: If S is regular ( x S, g 1 (x),..., g n 1 (x), h j1 (x),..., h j k (x) s. t. h jl (x) = 0 are l. i.) +f reaches its minimum at x S Finite Convergence and minimizer ideal Theorem. If (g 1,... g n 1 ; h 1,..., h n 2 ) is C-regular we have not duality gap. M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
35 Algorithm We suppose V min nite. Input:f R[x], G R[x] s.t. V x min VR (G) W + (H) π x (V R KKT ), H = {h 1,..., h n2 }. 1 t := 1 2 max{deg(f ), deg(g i), deg(h j )} ; 2 Compute Λ L t,g,h generic for f (solving a nite dimensional SDP problem by an interior point method); 3 Check the convergence certicate for M t Λ ; 4 If it is not satised, t := t + 1 and repeat from step (2); Otherwise compute K = ker M t Λ and Λ (f ) = f. Output: f = Λ (f ), K generators of I x min. we combine this algorithm with the border basis algorithm in order to reduce the size of the moments matrices. M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
36 Example - Robinson polynomial f (x, y) = 1 + x 6 x 4 x 2 + y 6 y 4 y 2 x 4 y 2 x 2 y 4 + 3x 2 y 2 ; Iteration Order Size min Λ(f ) Gap dim kerh Λ N N N N - In the second iteration we obtain B = {1, x, y, x 2, xy, y 2, x 2 y, xy 2, x 2 y 2 } there exits an element with degree 4. In the third iteration we obtain B = {1, x, y, x 2, xy, y 2, x 2 y, xy 2 } After fourth iteration the algoritm stops because kerh B 5 Λ = 0 and we obtain 1 I min = (x 3 x, y 3 y, x 2 y 2 x 2 y 2 + 1). 2 The basis B = {1, x, y, x 2, xy, y 2, x 2 y, xy 2 }. 3 The real roots {(x = 1, y = 1), (x = 1, y = 1), (x = 1, y = 1), (x = 1, y = 1), (x = 1, y = 0), (x = 1, y = 0), (x = 0, y = 1), (x = 0, y = 1)}. M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
37 Example with constraints f (x, y) = 12x 7y + y 2 ; s.t 2x y = 0; 0 x 2; 0 y 3; Iteration Order Size min Λ(f ) Gap dim kerh Λ 1 1 7(3) -36 N (6) N 9(5) (10) N - In the second iteration we obtain B = {1}. After third iteration the algoritm stops because kerh B 2 Λ = 0 and we obtain 1 I min = (x 0,7175, y 1,4698). 2 The basis B = {1}. 3 The real roots {(x = 0,7175, y = 1,4698)}. M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
38 Implementation and comparasion with Gloptipoly Implementation This algorithm is implemented in the package BORDERBASIX of MATHEMAGIX software. SDP problems are computed using SDPA or CSDP software.. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
39 Implementation and comparasion with Gloptipoly Implementation This algorithm is implemented in the package BORDERBASIX of MATHEMAGIX software. SDP problems are computed using SDPA or CSDP software. Comparasions with Gloptipoly The size of the moments matrices in our method is smaller due to the use of border basis We obtain the mininum with only one execution instead of many executions in the case of Gloptipoly Example variables degree Gloptipoly Our method Motzkin 2 6 order 9 - size 55 order 5 - size 19 Robinson 2 6 order 7 - size 36 order 6 - size 22 Nie 3 4 order 4 - size 34 order 3 - size 9 Simplices order 1 M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
40 Ongoing and Future works Applications: Tensor decomposition of rank 1 or 2 What happens when I min is not zero-dimensional? What happens when f is not reached? Solver numerical problem of the SDPA M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
41 Numerical problem f (x, y) = 16 + x 2 y 4 + 2x 2 y 3 4x 3 y 3 + 4xy x 2 y 2 + 8x 3 y 2 + 6x 4 y 2 + 8xy 16x 2 y f = 0,60902 and (x, y ) = ( 3,3884, 0,1434) We nd the minimum in order 4. Behavior in gloptipoly (nd local minimum not global minimum) msdp(min(f)) status =-1 (infeasible) msdp(min(f),di(f)==0) status=0 (not global optimality), f = 0,601 msdp(min(f),di(f)==0,10) status=1,f = 15,8283 and (x, y ) = (0,1156, 0,4839) Possible solution: use orthogonal basis instead of monomial basis M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
42 THANK YOU FOR YOUR ATTENTION!!! M. Abril-Bucero, B. Mourrain, P. Trebuchet Constrained (Inria Méditerranée, polynomial Galaad optimization team ) Juillet 15-19, / 21
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 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 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 informationTensor decomposition and moment matrices
Tensor decomposition and moment matrices J. Brachat (Ph.D.) & B. Mourrain GALAAD, INRIA Méditerranée, Sophia Antipolis Bernard.Mourrain@inria.fr SIAM AAG, Raleigh, NC, Oct. -9, 211 Collaboration with A.
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 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 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 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 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 informationReal eigenvalues of nonsymmetric tensors
Comput Optim Appl (208) 70: 32 https://doi.org/0.007/s0589-07-9973-y Real eigenvalues of nonsymmetric tensors Jiawang Nie Xinzhen Zhang 2 Received: 30 May 207 / Published online: 4 December 207 Springer
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 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 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 informationSparse representations from moments
Sparse representations from moments Bernard Mourrain Inria Méditerranée, Sophia Antipolis BernardMourrain@inriafr Sparse representation of signals Given a function or signal f (t): decompose it as f (t)
More informationDetecting global optimality and extracting solutions in GloptiPoly
Detecting global optimality and extracting solutions in GloptiPoly Didier HENRION 1,2 Jean-Bernard LASSERRE 1 1 LAAS-CNRS Toulouse 2 ÚTIA-AVČR Prague Part 1 Description of GloptiPoly Brief description
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 informationTowards Solving Bilevel Optimization Problems in Quantum Information Theory
Towards Solving Bilevel Optimization Problems in Quantum Information Theory ICFO-The Institute of Photonic Sciences and University of Borås 22 January 2016 Workshop on Linear Matrix Inequalities, Semidefinite
More information4TE3/6TE3. Algorithms for. Continuous Optimization
4TE3/6TE3 Algorithms for Continuous Optimization (Algorithms for Constrained Nonlinear Optimization Problems) Tamás TERLAKY Computing and Software McMaster University Hamilton, November 2005 terlaky@mcmaster.ca
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 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 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 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 informationHilbert 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 informationCertified Roundoff Error Bounds using Semidefinite Programming
Certified Roundoff Error Bounds using Semidefinite Programming Victor Magron, CNRS VERIMAG joint work with G. Constantinides and A. Donaldson INRIA Mescal Team Seminar 19 November 2015 Victor Magron Certified
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 informationInterior Point Algorithms for Constrained Convex Optimization
Interior Point Algorithms for Constrained Convex Optimization Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Inequality constrained minimization problems
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 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 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 informationFormal Proofs, Program Analysis and Moment-SOS Relaxations
Formal Proofs, Program Analysis and Moment-SOS Relaxations Victor Magron, Postdoc LAAS-CNRS 15 July 2014 Imperial College Department of Electrical and Electronic Eng. y b sin( par + b) b 1 1 b1 b2 par
More informationALGEBRAIC DEGREE OF POLYNOMIAL OPTIMIZATION. 1. Introduction. f 0 (x)
ALGEBRAIC DEGREE OF POLYNOMIAL OPTIMIZATION JIAWANG NIE AND KRISTIAN RANESTAD Abstract. Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials.
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 information9. 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 information10 Numerical methods for constrained problems
10 Numerical methods for constrained problems min s.t. f(x) h(x) = 0 (l), g(x) 0 (m), x X The algorithms can be roughly divided the following way: ˆ primal methods: find descent direction keeping inside
More information12. Interior-point methods
12. Interior-point methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
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 informationLecture 3: Semidefinite Programming
Lecture 3: Semidefinite Programming Lecture Outline Part I: Semidefinite programming, examples, canonical form, and duality Part II: Strong Duality Failure Examples Part III: Conditions for strong duality
More informationSemidefinite Relaxations Approach to Polynomial Optimization and One Application. Li Wang
Semidefinite Relaxations Approach to Polynomial Optimization and One Application Li Wang University of California, San Diego Institute for Computational and Experimental Research in Mathematics September
More informationSemialgebraic 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 informationExample: feasibility. Interpretation as formal proof. Example: linear inequalities and Farkas lemma
4-1 Algebra and Duality P. Parrilo and S. Lall 2006.06.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone of valid
More informationLecture 18: Optimization Programming
Fall, 2016 Outline Unconstrained Optimization 1 Unconstrained Optimization 2 Equality-constrained Optimization Inequality-constrained Optimization Mixture-constrained Optimization 3 Quadratic Programming
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 informationLOWER 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 informationDe Nugis Groebnerialium 5: Noether, Macaulay, Jordan
De Nugis Groebnerialium 5: Noether, Macaulay, Jordan ACA 2018 Santiago de Compostela Re-reading Macaulay References Macaulay F. S., On the Resolution of a given Modular System into Primary Systems including
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 informationthat a broad class of conic convex polynomial optimization problems, called
JOTA manuscript No. (will be inserted by the editor) Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone-Programs Vaithilingam Jeyakumar Guoyin Li Communicated by Levent Tunçel Abstract
More informationNotes 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 informationTutorial on Convex Optimization: Part II
Tutorial on Convex Optimization: Part II Dr. Khaled Ardah Communications Research Laboratory TU Ilmenau Dec. 18, 2018 Outline Convex Optimization Review Lagrangian Duality Applications Optimal Power Allocation
More informationLagrange duality. The Lagrangian. We consider an optimization program of the form
Lagrange duality Another way to arrive at the KKT conditions, and one which gives us some insight on solving constrained optimization problems, is through the Lagrange dual. The dual is a maximization
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 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 informationOptimization for Communications and Networks. Poompat Saengudomlert. Session 4 Duality and Lagrange Multipliers
Optimization for Communications and Networks Poompat Saengudomlert Session 4 Duality and Lagrange Multipliers P Saengudomlert (2015) Optimization Session 4 1 / 14 24 Dual Problems Consider a primal convex
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 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 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 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 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 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 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 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 informationOptimization Methods. Lecture 23: Semidenite Optimization
5.93 Optimization Methods Lecture 23: Semidenite Optimization Outline. Preliminaries Slide 2. SDO 3. Duality 4. SDO Modeling Power 5. Barrier lgorithm for SDO 2 Preliminaries symmetric matrix is positive
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 informationConvex Optimization and Modeling
Convex Optimization and Modeling Duality Theory and Optimality Conditions 5th lecture, 12.05.2010 Jun.-Prof. Matthias Hein Program of today/next lecture Lagrangian and duality: the Lagrangian the dual
More informationApplications of Linear Programming
Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 9 Non-linear programming In case of LP, the goal
More informationLinear and Combinatorial Optimization
Linear and Combinatorial Optimization The dual of an LP-problem. Connections between primal and dual. Duality theorems and complementary slack. Philipp Birken (Ctr. for the Math. Sc.) Lecture 3: Duality
More informationTranspose & Dot Product
Transpose & Dot Product Def: The transpose of an m n matrix A is the n m matrix A T whose columns are the rows of A. So: The columns of A T are the rows of A. The rows of A T are the columns of A. Example:
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 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 information15.083J Optimization over Integers. Lectures 13-14: Algebraic geometry and integer optimization
1 15.083J Optimization over Integers Lectures 13-14: Algebraic geometry and integer optimization Typos and errors corrected. Section 7.4 completely rewritten. geometry optimization optimization 7.1. Background
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More informationStructural and Multidisciplinary Optimization. P. Duysinx and P. Tossings
Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be
More informationTranspose & Dot Product
Transpose & Dot Product Def: The transpose of an m n matrix A is the n m matrix A T whose columns are the rows of A. So: The columns of A T are the rows of A. The rows of A T are the columns of A. Example:
More informationOn the local stability of semidefinite relaxations
On the local stability of semidefinite relaxations Diego Cifuentes Department of Mathematics Massachusetts Institute of Technology Joint work with Sameer Agarwal (Google), Pablo Parrilo (MIT), Rekha Thomas
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 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 informationBBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints
BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints N. Ito, S. Kim, M. Kojima, A. Takeda, and K.-C. Toh March, 2018 Abstract.
More informationLagrange Relaxation and Duality
Lagrange Relaxation and Duality As we have already known, constrained optimization problems are harder to solve than unconstrained problems. By relaxation we can solve a more difficult problem by a simpler
More informationAPPROXIMATE OPTIMAL DESIGNS FOR MULTIVARIATE POLYNOMIAL REGRESSION
The Annals of Statistics 2019, Vol. 47, No. 1, 127 155 https://doi.org/10.1214/18-aos1683 Institute of Mathematical Statistics, 2019 APPROXIMATE OPTIMAL DESIGNS FOR MULTIVARIATE POLYNOMIAL REGRESSION BY
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 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 informationSemidefinite Programming, Combinatorial Optimization and Real Algebraic Geometry
Semidefinite Programming, Combinatorial Optimization and Real Algebraic Geometry assoc. prof., Ph.D. 1 1 UNM - Faculty of information studies Edinburgh, 16. September 2014 Outline Introduction Definition
More informationImplicit matrix representations of rational Bézier curves and surfaces
Implicit matrix representations of rational Bézier curves and surfaces Laurent Busé GALAAD, INRIA, 2004 route des Lucioles, 06902 Sophia Antipolis, France Abstract We introduce and study a new implicit
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 informationPrimal-Dual Interior-Point Methods
Primal-Dual Interior-Point Methods Lecturer: Aarti Singh Co-instructor: Pradeep Ravikumar Convex Optimization 10-725/36-725 Outline Today: Primal-dual interior-point method Special case: linear programming
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 informationSpecial Classes of Fuzzy Integer Programming Models with All-Dierent Constraints
Transaction E: Industrial Engineering Vol. 16, No. 1, pp. 1{10 c Sharif University of Technology, June 2009 Special Classes of Fuzzy Integer Programming Models with All-Dierent Constraints Abstract. K.
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 informationON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, BAHMAN KALANTARI
ON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, MATRIX SCALING, AND GORDAN'S THEOREM BAHMAN KALANTARI Abstract. It is a classical inequality that the minimum of
More informationNew applications of moment-sos hierarchies
New applications of moment-sos hierarchies Victor Magron, Postdoc LAAS-CNRS 13 August 2014 専攻談話会 ( セミナー ) Tokyo Institute of Technology Dept. of Math. & Comput. Sci. y b sin( par + b) b 1 1 b1 b2 par +
More informationApplications of semidefinite programming in Algebraic Combinatorics
Applications of semidefinite programming in Algebraic Combinatorics Tohoku University The 23rd RAMP Symposium October 24, 2011 We often want to 1 Bound the value of a numerical parameter of certain combinatorial
More informationConvex Optimization. Newton s method. ENSAE: Optimisation 1/44
Convex Optimization Newton s method ENSAE: Optimisation 1/44 Unconstrained minimization minimize f(x) f convex, twice continuously differentiable (hence dom f open) we assume optimal value p = inf x f(x)
More informationNumerical Optimization
Linear Programming - Interior Point Methods Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Example 1 Computational Complexity of Simplex Algorithm
More informationINDEFINITE TRUST REGION SUBPROBLEMS AND NONSYMMETRIC EIGENVALUE PERTURBATIONS. Ronald J. Stern. Concordia University
INDEFINITE TRUST REGION SUBPROBLEMS AND NONSYMMETRIC EIGENVALUE PERTURBATIONS Ronald J. Stern Concordia University Department of Mathematics and Statistics Montreal, Quebec H4B 1R6, Canada and Henry Wolkowicz
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EECS 227A Nonlinear and Convex Optimization. Solutions 5 Fall 2009
UC Berkeley Department of Electrical Engineering and Computer Science EECS 227A Nonlinear and Convex Optimization Solutions 5 Fall 2009 Reading: Boyd and Vandenberghe, Chapter 5 Solution 5.1 Note that
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 informationA Moment Matrix Approach to Multivariable Cubature
A Moment Matrix Approach to Multivariable Cubature Lawrence Fialkow* and Srdjan Petrovic** Abstract. We develop an approach to multivariable cubature based on positivity, extension, and completion properties
More informationLECTURE 6: VECTOR SPACES II (CHAPTER 3 IN THE BOOK)
LECTURE 6: VECTOR SPACES II (CHAPTER 3 IN THE BOOK) In this lecture, F is a fixed field. One can assume F = R or C. 1. More about the spanning set 1.1. Let S = { v 1, v n } be n vectors in V, we have defined
More informationLecture 15 Newton Method and Self-Concordance. October 23, 2008
Newton Method and Self-Concordance October 23, 2008 Outline Lecture 15 Self-concordance Notion Self-concordant Functions Operations Preserving Self-concordance Properties of Self-concordant Functions Implications
More information