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


 Jean Griffin
 9 months ago
 Views:
Transcription
1 LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAASCNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009
2 Minors A minor of a matrix F is the determinant of a submatrix of F, say with row index I and column index J If I = J this is a principal minor If I = J = 1... k this is a leading principal minor A symmetric matrix F is positive definite iff all its leading principal minors are positive A symmetric matrix F is positive semidefinite iff all its principal minors are nonnegative
3 Positive semidefiniteness If F R m m we have 2 m 1 principal minors A simpler and equivalent criterion follows from the fact that a univariate polynomial t f(t) = k f m k t k = k(t t k ) which has only real roots satisfies t k 0 iff f k 0 Apply to characteristic polynomial t f(t) = det(ti m + F ) = m k=0 f m k (F )t k A symmetric matrix F is positive semidefinite iff f i (F ) 0, i Only m polynomials to be checked, they are (signed) sums of principal minors
4 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F = {x R n : F (x) = F 0 + n i=1 x i F i 0} Build characteristic polynomial t f(t, x) = det(ti m + F (x)) = which is monic, i.e. f 0 (x) = 1 m k=0 f m k (x)t k Matrix F (x) is PSD iff f i (x) 0 for all i = 1,..., m
5 Semialgebraic description Diagonal minors are multivariate polynomials of the x i So the LMI set can be described as F = {x R n : f i (x) 0, i = 1, 2,...} which is a basic semialgebraic set (basic = intersection of polynomial levelsets) Moreover, it is a convex set
6 Example of 2D LMI feasible set F (x) = 1 x 1 x 1 + x 2 x 1 x 1 + x 2 2 x 2 0 x x 2 0 System of 3 polynomial inequalities f i (x) 0 1st order minors: f 1 (x) = 4 x 1 0 LMI set = intersection of an infinite number of halfspaces {x : y T F (x)y 0} for all y R 3
7 2nd order: f 2 (x) = 5 3x 1 + x 2 2x 2 1 2x 1x 2 2x x x 1
8 3rd order: f 3 (x) = 2 2x 1 +x 2 3x 2 1 3x 1x 2 2x 2 2 x 1x 2 2 x x x 1
9 LMI feasible set = intersection of sets {x : f i (x) 0}, i = 1, 2, x x 1 Boundary of LMI region shaped by determinant Other polynomials only isolate convex connected component
10 Example of 3D LMI feasible set F = {x R 3 : 1 x 1 x 2 x 1 1 x 3 x 2 x 3 1 } {{ } F (x) 0} A smoothened tetrahedron.. vertices correspond to points x for which rank F (x) = 1
11 Semialgebraic formulation F = {x R 3 : 1+2x 1 x 2 x 3 (x 2 1 +x2 2 +x2 3 ) 0, 3 x2 1 x2 2 x2 3 0}
12 Intersection of LMI sets Intersection of LMI feasible sets is also LMI F (x) 0 x 1 2 2x 1 + x 2 0
13 LMI sets LMI sets are convex basic semialgebraic sets.. but are all convex basic semialgebraic sets LMI? Let us make a fundamental distinction between LMI representable sets liftedlmi representable sets We say that a convex set X R n is LMI representable if there exists an affine mapping F (x) such that x X F (x) 0
14 LMI and liftedlmi representability We say that a convex set X R n is liftedlmi representable if there exists an affine mapping F (x, u) such that x X u R m : F (x, u) 0 A set X is liftedlmi representable when x X u : F (x, u) 0 i.e. when it is the projection of the solution set of the LMI F (x, u) 0 onto the xspace and u are additional, or lifting variables In other words, lifting variables u are not allowed in LMI representations
15 LMI and liftedlmi functions Similarly, a convex function f representable if its epigraph : R n R is LMI (or liftedlmi) {x, t : f(x) t} is an LMI (or liftedlmi) representable set x x 1
16 Conic quadratic forms The Lorentz, or icecream cone is LMI representable as {x, t R n R : x 2 t} { [ tin x ] } x, t R n R : x T t 0 As a result, all secondorder conic sets are LMI representable In the sequel we give a list of LMI and liftedlmi representable sets (following BenTal, Nemirovski, Nesterov)
17 Quadratic forms The Euclidean norm {x, t R n R : x 2 t} is LMI representable (see previous slide) The squared Euclidean norm {x, t R n R : x T x t} is also LMI representable as [ t x T x I n ] 0
18 Quadratic forms (2) The convex quadratic set {x R n A = A T 0 is LMI representable as : x T Ax + b T x + c 0} with [ b T x c x T D T ] Dx I n 0 where D is the Cholesky factor of A = D T D
19 Hyperbola The branch of hyperbola {x, y R 2 : x 0, xy 1} is LMI representable as [ x 1 1 y ] 0
20 Geometric mean of two variables The hypograph of the geometric mean of 2 variables {x 1, x 2, t R 3 : x 1, x 2 0, x 1 x 2 t} is LMI representable as [ x1 t t x 2 ] 0
21 Geometric mean of several variables The hypograph of the geometric mean of 2 k variables {x 1,..., x 2 k, t R 2k +1 : x i 0, (x 1 x 2 k) 1/2k t} is liftedlmi representable Proof: iterate the previous construction by introducing lifting variables Example with k = 3: x1 x 2 x 11 x3 x 4 x 12 x5 x 6 x 13 x7 x 8 x 14 (x 1 x 2 x 8 ) 1/8 t } x11 x 12 x 21 x21 x x13 x 14 x 22 t 22 Useful idea in other LMI representability problems
22 Rational power functions Following the same ideas, the increasing rational power functions f(x) = x p/q, x 0 with rational p/q 1, are liftedlmi representable
23 Rational power functions Similarly, the decreasing rational power functions g(x) = x p/q, x 0 with rational p/q 0, are liftedlmi representable
24 Rational power functions Example: {x, t : x 0, x 7/3 t} Start from liftedlmi representable ˆt (ˆx 1 ˆx 8 ) 1/8 and replace to get ˆt = ˆx 1 = x 0 ˆx 2 = ˆx 3 = ˆx 4 = t 0 ˆx 5 = ˆx 6 = ˆx 7 = ˆx 8 = 1 x x 1/8 t 3/8 x 7/8 t 3/8 x 7/3 t Same idea works for any rational p/q 1 lift = use additional variables, and project in the space of original variables
25 Even power monomial The epigraph of even power monomial F = {x, t : x 2p t} where p is a positive integer is liftedlmi representable Indeed {x, t : x 2p t} {x, y, t : x 2 y} and {x, y, t : y 0, y p t}, both liftedlmi representable Use lifting y and project back onto x, t Similarly, even power polynomials are liftedlmi representable (several monomials)
26 Quartic level set Model quartic level set F = {x, t : x 4 t} as LMI in x, t and y F = {x, t : y : y x 2, t y 2, y 0} [ 1 x x y ] 0 [ 1 y y t ] 0 It can be shown that it is impossible to remove the lifting variable y while keeping a (finitedimensional) LMI formulation
27 Quartic level set: from 3D to 2D F = {x, t : x 4 t}
28 Largest eigenvalue Function largest eigenvalue of a symmetric matrix {X = X T R n n, t R : λ max (X) t} is LMI representable as X ti n Eigenvalues of matrix [ ] 1 x1 x 1 x 2
29 Sums of largest eigenvalues Let S k (X) = k i=1 λ i (X), k = 1,..., n denote the sum of the k largest eigenvalues of an nbyn symmetric matrix X The epigraph {X = X T R n n, t R : S k (X) t} is liftedlmi representable as t ks trace Z 0 Z 0 Z X + si n 0 where Z and s are liftings
30 The determinant Determinant of a PSD matrix det(x) = n λ i (X) i=1 is not a convex function of X, but the function is convex when q [0, 1/n] is rational f q (X) = det q (X), X = X T 0 The epigraph {X = X T R n n, t R : f q (X) t} is liftedlmi representable [ ] X T 0 diag t (δ 1 δ n ) q since we know that the latter constraint (hypograph of a concave monomial) is liftedlmi representable Here is a lower triangular matrix of liftings with diagonal entries δ i
31 Application: extremal ellipsoids A little excursion in the world of ellipsoids and polytopes.. Various representations of an ellipsoid in R n E = {x R n : x T P x + 2x T q + r 0} = {x R n : (x x c ) T P (x x c ) 1} = {x = Qy + x c R n : y T y 1} = {x R n : Rx x c 1} where Q = R 1 = P 1/2 0
32 Ellipsoid volume Volume of ellipsoid E = {Qy + x c : y T y 1} vol E = k n det Q where k n is volume of ndimensional unit ball k n = 2 (n+1)/2 π (n 1)/2 n(n 2)!! 2π n/2 n(n/2 1)! for n odd for n even n k n Unit ball has maximum volume for n = 5
33 Outer and inner ellipsoidal approximations Let S R n be a solid = a closed bounded convex set with nonempty interior the largest volume ellipsoid E in contained in S is unique and satisfies E in S ne in the smallest volume ellipsoid E out containing S is unique and satisfies E out /n S E out These are LöwnerJohn ellipsoids Factor n reduces to n if S is symmetric How can these ellipsoids be computed?
34 Ellipsoid in polytope Let the intersection of hyperplanes S = {x R n : a T i x b i, i = 1,..., m} describe a polytope = bounded nonempty polyhedron The largest volume ellipsoid contained in S is E = {Qy + x c : y T y 1} where Q, x c are optimal solutions of the LMI problem max det 1/n Q Q 0 Qa i 2 b i a T i x c
35 Polytope in ellipsoid Let the convex hull of vertices S = conv {x 1,..., x m } describe a polytope The smallest volume ellipsoid containing S is E = {x : (x x c ) T P (x x c ) 1} where P, x c = P 1 q are optimal solutions of the LMI problem max t t[ det 1/n ] P P q q T 0 r x T i P x i + 2x T i q + r 1
36 Let Sums of largest singular values Σ k (X) = k i=1 σ i (X), k = 1,..., n denote the sum of the k largest singular values of an nbym matrix X Then the epigraph {X R n m, t R : Σ k (X) t} is liftedlmi representable since X T ([ 0 σ i (X) = λ i X 0 ]) and the sum of largest eigenvalues of a symmetric matrix is liftedlmi representable
37 Positive polynomials The set of univariate polynomials that are positive on the real axis is liftedlmi representable in the coefficient space Can be proved with cone duality (Nesterov) or with theory of moments (Lasserre)  more on that later The even polynomial p(s) = p 0 + p 1 s + + p 2n s 2n satisfies p(s) 0 for all s R if and only if p k = i+j=k X ij, k = 0, 1,..., 2n = trace H k X for some lifting matrix X = X T 0
38 Sumofsquares decomposition The expression of p k with Hankel matrices H k comes from p(s) = [1 s s n ]X[1 s s n ] hence X 0 naturally implies p(s) 0 Conversely, existence of X for any polynomial p(s) 0 follows from the existence of a sumofsquares (SOS) decomposition (with at most two elements) of p(s) = k q 2 k (s) 0 Matrix X has entries X ij = k q ki q kj Seeking the lifting matrix amounts to seeking an SOS decomposition
39 Primal and dual formulations Global minimization of polynomial p(s) = n k=0 p k s k Global optimum p : maximum value of ˆp such that p(s) ˆp 0 Primal LMI problem Dual LMI problem max ˆp = p 0 trace H 0 X s.t. trace H k X = p k, k = 1,..., n X 0 min p 0 + n k=1 p k y k s.t. H 0 + n k=1 H k y k 0 with Hankel structure (moment matrix)
40 Positive polynomials and LMIs Example: Global minimization of the polynomial p(s) = 48 92s + 56s 2 13s 3 + s 4 Solving the dual LMI problem yields p = p(5.25) = min 48 92y y 2 13y 3 + y 4 s.t. 1 y 1 y 2 y 1 y 2 y 3 0 y 2 y 3 y 4
41 Complex LMIs The complex valued LMI F (x) = A(x) + jb(x) 0 is equivalent to the real valued LMI [ A(x) B(x) B(x) A(x) ] 0 If there is a complex solution to the LMI then there is a real solution to the same LMI Note that matrix A(x) = A T (x) is symmetric whereas B(x) = B T (x) is skewsymmetric
42 INTERLUDE
43 LMI set or not? x x 1 x 1 x 2 1 and x 1 0
44 LMI x 1 x 2 1 and x 1 0 [ x1 1 1 x 2 ] 0
45 LMI set or not? x x 1 x 2 x 2 1
46 LMI x 2 x 2 1 [ 1 x1 x 1 x 2 ] 0
47 LMI set or not? x x 1 x x2 2 1
48 LMI x x2 2 1 [ 1 + x1 x 2 x 2 1 x 1 ] 0
49 LMI set or not? x x 1 {x R 2 : t 4 + 2x 1 t 2 + x 2 0, t R}
50 NOT LMI: not basic semialgebraic x x 1 x 2 x 2 1 or x 1, x 2 0
51 LMI set or not? x x 1 1 2x 1 x 2 1 x x3 1 0
52 NOT LMI: not connected x x 1 x 2 1 x x3 1 0 x 1
53 LMI set or not? x x 1 1 2x 1 x 2 1 x x3 1 0 and x 1 1 2
54 LMI 1 2x 1 x 2 1 x x3 1 0 and x x 1 0 x 1 1 x 2 0 x 2 1 2x 1 0
55 LMI set or not? x x 1 x x4 2 1
56 NOT LMI but projection of an LMI 1 + u 1 u 2 u 2 1 u 1 1 x 1 x 1 u 1 1 x 2 0 x 2 u 2 with two liftings u 1 and u 2
COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion
COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F
More information9. Interpretations, Lifting, SOS and Moments
91 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 informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17
EE/ACM 150  Applications of Convex Optimization in Signal Processing and Communications Lecture 17 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 29, 2012 Andre Tkacenko
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 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 nmatrix A the following
More information15. Conic optimization
L. Vandenberghe EE236C (Spring 216) 15. Conic optimization conic linear program examples modeling duality 151 Generalized (conic) inequalities Conic inequality: a constraint x K where K is a convex cone
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 Minimum volume ellipsoid around a set LöwnerJohn ellipsoid
More informationLecture 6  Convex Sets
Lecture 6  Convex Sets Definition A set C R n is called convex if for any x, y C and λ [0, 1], the point λx + (1 λ)y belongs to C. The above definition is equivalent to saying that for any x, y C, the
More informationWhat can be expressed via Conic Quadratic and Semidefinite Programming?
What can be expressed via Conic Quadratic and Semidefinite Programming? A. Nemirovski Faculty of Industrial Engineering and Management Technion Israel Institute of Technology Abstract Tremendous recent
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 informationGeometric problems. Chapter Projection on a set. The distance of a point x 0 R n to a closed set C R n, in the norm, is defined as
Chapter 8 Geometric problems 8.1 Projection on a set The distance of a point x 0 R n to a closed set C R n, in the norm, is defined as dist(x 0,C) = inf{ x 0 x x C}. The infimum here is always achieved.
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 1 Minimum volume ellipsoid around a set LöwnerJohn ellipsoid
More informationThe Geometry of Semidefinite Programming. Bernd Sturmfels UC Berkeley
The Geometry of Semidefinite Programming Bernd Sturmfels UC Berkeley Positive Semidefinite Matrices For a real symmetric n nmatrix A the following are equivalent: All n eigenvalues of A are positive real
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 informationIE 521 Convex Optimization
Lecture 1: 16th January 2019 Outline 1 / 20 Which set is different from others? Figure: Four sets 2 / 20 Which set is different from others? Figure: Four sets 3 / 20 Interior, Closure, Boundary Definition.
More informationLecture: Examples of LP, SOCP and SDP
1/34 Lecture: Examples of LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2018.html wenzw@pku.edu.cn Acknowledgement:
More informationLecture Note 5: Semidefinite Programming for Stability Analysis
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State
More informationCONTAINMENT PROBLEMS FOR POLYTOPES AND SPECTRAHEDRA
CONTAINMENT PROBLEMS FOR POLYTOPES AND SPECTRAHEDRA KAI KELLNER, THORSTEN THEOBALD, AND CHRISTIAN TRABANDT Abstract. We study the computational question whether a given polytope or spectrahedron S A (as
More informationConvex Optimization & Parsimony of L pballs representation
Convex Optimization & Parsimony of L p balls representation LAASCNRS and Institute of Mathematics, Toulouse, France IMA, January 2016 Motivation Unit balls associated with nonnegative homogeneous polynomials
More informationSPECTRAHEDRA. Bernd Sturmfels UC Berkeley
SPECTRAHEDRA Bernd Sturmfels UC Berkeley Mathematics Colloquium, North Carolina State University February 5, 2010 Positive Semidefinite Matrices For a real symmetric n nmatrix A the following are equivalent:
More informationMathematics 530. Practice Problems. n + 1 }
Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined
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 informationAppendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS
Appendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS Here we consider systems of linear constraints, consisting of equations or inequalities or both. A feasible solution
More informationSummer School: Semidefinite Optimization
Summer School: Semidefinite Optimization Christine Bachoc Université Bordeaux I, IMB Research Training Group Experimental and Constructive Algebra Haus Karrenberg, Sept. 3  Sept. 7, 2012 Duality Theory
More informationDeterminant maximization with linear. S. Boyd, L. Vandenberghe, S.P. Wu. Information Systems Laboratory. Stanford University
Determinant maximization with linear matrix inequality constraints S. Boyd, L. Vandenberghe, S.P. Wu Information Systems Laboratory Stanford University SCCM Seminar 5 February 1996 1 MAXDET problem denition
More informationChapter 2: Preliminaries and elements of convex analysis
Chapter 2: Preliminaries and elements of convex analysis Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt1415.shtml Academic year 201415
More informationELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications
ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March
More informationLECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE
LECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE CONVEX ANALYSIS AND DUALITY Basic concepts of convex analysis Basic concepts of convex optimization Geometric duality framework  MC/MC Constrained optimization
More informationI.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec  Spring 2010
I.3. LMI DUALITY Didier HENRION henrion@laas.fr EECI Graduate School on Control Supélec  Spring 2010 Primal and dual For primal problem p = inf x g 0 (x) s.t. g i (x) 0 define Lagrangian L(x, z) = g 0
More informationChapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space.
Chapter 1 Preliminaries The purpose of this chapter is to provide some basic background information. Linear Space Hilbert Space Basic Principles 1 2 Preliminaries Linear Space The notion of linear space
More informationA notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations
A notion of for Convex, Semidefinite and Extended Formulations Marcel de Carli Silva Levent Tunçel April 26, 2018 A vector in R n is integral if each of its components is an integer, A vector in R n is
More 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 informationHW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.
HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a realvalued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard
More informationThe Algebraic Degree of Semidefinite Programming
The Algebraic Degree ofsemidefinite Programming p. The Algebraic Degree of Semidefinite Programming BERND STURMFELS UNIVERSITY OF CALIFORNIA, BERKELEY joint work with and Jiawang Nie (IMA Minneapolis)
More informationRobust conic quadratic programming with ellipsoidal uncertainties
Robust conic quadratic programming with ellipsoidal uncertainties Roland Hildebrand (LJK Grenoble 1 / CNRS, Grenoble) KTH, Stockholm; November 13, 2008 1 Uncertain conic programs min x c, x : Ax + b K
More informationLecture 8. Strong Duality Results. September 22, 2008
Strong Duality Results September 22, 2008 Outline Lecture 8 Slater Condition and its Variations Convex Objective with Linear Inequality Constraints Quadratic Objective over Quadratic Constraints Representation
More informationLecture 1 Introduction
L. Vandenberghe EE236A (Fall 201314) Lecture 1 Introduction course overview linear optimization examples history approximate syllabus basic definitions linear optimization in vector and matrix notation
More information9. Geometric problems
9. Geometric problems EE/AA 578, Univ of Washington, Fall 2016 projection on a set extremal volume ellipsoids centering classification 9 1 Projection on convex set projection of point x on set C defined
More informationRobust and Optimal Control, Spring 2015
Robust and Optimal Control, Spring 2015 Instructor: Prof. Masayuki Fujita (S5303B) 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 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 informationLargest dual ellipsoids inscribed in dual cones
Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that
More information4. Convex optimization problems
Convex Optimization Boyd & Vandenberghe 4. Convex optimization problems optimization problem in standard form convex optimization problems quasiconvex optimization linear optimization quadratic optimization
More informationThe momentlp and momentsos approaches
The momentlp and momentsos approaches LAASCNRS and Institute of Mathematics, Toulouse, France CIRM, November 2013 Semidefinite Programming Why polynomial optimization? LP and SDP CERTIFICATES of POSITIVITY
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationNonlinear Programming Models
Nonlinear Programming Models Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Nonlinear Programming Models p. Introduction Nonlinear Programming Models p. NLP problems minf(x) x S R n Standard form:
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 informationMatrix Rank Minimization with Applications
Matrix Rank Minimization with Applications Maryam Fazel Haitham Hindi Stephen Boyd Information Systems Lab Electrical Engineering Department Stanford University 8/2001 ACC 01 Outline Rank Minimization
More informationAdditional Homework Problems
Additional Homework Problems Robert M. Freund April, 2004 2004 Massachusetts Institute of Technology. 1 2 1 Exercises 1. Let IR n + denote the nonnegative orthant, namely IR + n = {x IR n x j ( ) 0,j =1,...,n}.
More informationA ten page introduction to conic optimization
CHAPTER 1 A ten page introduction to conic optimization This background chapter gives an introduction to conic optimization. We do not give proofs, but focus on important (for this thesis) tools and concepts.
More informationOptimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16: Linear programming. Optimization Problems
Optimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16:38 2001 Linear programming Optimization Problems General optimization problem max{z(x) f j (x) 0,x D} or min{z(x) f j (x) 0,x D}
More informationSemidefinite representation of convex hulls of rational varieties
Semidefinite representation of convex hulls of rational varieties Didier Henrion 1,2 June 1, 2011 Abstract Using elementary duality properties of positive semidefinite moment matrices and polynomial sumofsquares
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 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 informationContinuous Optimisation, Chpt 9: Semidefinite Optimisation
Continuous Optimisation, Chpt 9: Semidefinite Optimisation Peter J.C. Dickinson DMMP, University of Twente p.j.c.dickinson@utwente.nl http://dickinson.website/teaching/2017co.html version: 28/11/17 Monday
More informationInner approximation of convex cones via primaldual ellipsoidal norms
Inner approximation of convex cones via primaldual ellipsoidal norms by Miaolan Xie A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of
More informationSymmetric Matrices and Eigendecomposition
Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions
More informationLecture: Convex Optimization Problems
1/36 Lecture: Convex Optimization Problems http://bicmr.pku.edu.cn/~wenzw/opt2015fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghe s lecture notes Introduction 2/36 optimization
More informationLecture: Cone programming. Approximating the Lorentz cone.
Strong relaxations for discrete optimization problems 10/05/16 Lecture: Cone programming. Approximating the Lorentz cone. Lecturer: Yuri Faenza Scribes: Igor Malinović 1 Introduction Cone programming is
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 28th, 2013 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationSemidefinite Programming
Chapter 2 Semidefinite Programming 2.0.1 Semidefinite programming (SDP) Given C M n, A i M n, i = 1, 2,..., m, and b R m, the semidefinite programming problem is to find a matrix X M n for the optimization
More informationConic Linear Programming. Yinyu Ye
Conic Linear Programming Yinyu Ye December 2004, revised October 2017 i ii Preface This monograph is developed for MS&E 314, Conic Linear Programming, which I am teaching at Stanford. Information, lecture
More informationSemidefinite geometry of the numerical range
Electronic Journal of Linear Algebra Volume 2 Volume 2 (2) Article 24 2 Semidefinite geometry of the numerical range Didier Henrion henrion@laas.fr Follow this and additional works at: http://repository.uwyo.edu/ela
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 WeiTa Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationL. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones. definition. spectral decomposition. quadratic representation. logdet barrier 181
L. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones definition spectral decomposition quadratic representation logdet barrier 181 Introduction This lecture: theoretical properties of the following
More informationCSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming
CSC2411  Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming
More informationIntroduction to Semidefinite Programming I: Basic properties a
Introduction to Semidefinite Programming I: Basic properties and variations on the GoemansWilliamson approximation algorithm for maxcut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite
More informationLECTURE 13 LECTURE OUTLINE
LECTURE 13 LECTURE OUTLINE Problem Structures Separable problems Integer/discrete problems Branchandbound Large sum problems Problems with many constraints Conic Programming Second Order Cone Programming
More informationConic Linear Programming. Yinyu Ye
Conic Linear Programming Yinyu Ye December 2004, revised January 2015 i ii Preface This monograph is developed for MS&E 314, Conic Linear Programming, which I am teaching at Stanford. Information, lecture
More informationAgenda. 1 Cone programming. 2 Convex cones. 3 Generalized inequalities. 4 Linear programming (LP) 5 Secondorder cone programming (SOCP)
Agenda 1 Cone programming 2 Convex cones 3 Generalized inequalities 4 Linear programming (LP) 5 Secondorder cone programming (SOCP) 6 Semidefinite programming (SDP) 7 Examples Optimization problem in
More informationUnbounded Convex Semialgebraic Sets as Spectrahedral Shadows
Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows Shaowei Lin 9 Dec 2010 Abstract Recently, Helton and Nie [3] showed that a compact convex semialgebraic set S is a spectrahedral shadow if the
More informationContinuous Optimisation, Chpt 9: Semidefinite Problems
Continuous Optimisation, Chpt 9: Semidefinite Problems Peter J.C. Dickinson DMMP, University of Twente p.j.c.dickinson@utwente.nl http://dickinson.website/teaching/2016co.html version: 21/11/16 Monday
More informationLecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.
MA 796S: Convex Optimization and Interior Point Methods October 8, 2007 Lecture 1 Lecturer: Kartik Sivaramakrishnan Scribe: Kartik Sivaramakrishnan 1 Conic programming Consider the conic program min s.t.
More informationConvex Optimization M2
Convex Optimization M2 Lecture 3 A. d Aspremont. Convex Optimization M2. 1/49 Duality A. d Aspremont. Convex Optimization M2. 2/49 DMs DM par email: dm.daspremont@gmail.com A. d Aspremont. Convex Optimization
More informationThe general programming problem is the nonlinear programming problem where a given function is maximized subject to a set of inequality constraints.
1 Optimization Mathematical programming refers to the basic mathematical problem of finding a maximum to a function, f, subject to some constraints. 1 In other words, the objective is to find a point,
More informationCSCI 1951G Optimization Methods in Finance Part 10: Conic Optimization
CSCI 1951G Optimization Methods in Finance Part 10: Conic Optimization April 6, 2018 1 / 34 This material is covered in the textbook, Chapters 9 and 10. Some of the materials are taken from it. Some of
More informationMath (P)refresher Lecture 8: Unconstrained Optimization
Math (P)refresher Lecture 8: Unconstrained Optimization September 2006 Today s Topics : Quadratic Forms Definiteness of Quadratic Forms Maxima and Minima in R n First Order Conditions Second Order Conditions
More informationLinear and nonlinear programming
Linear and nonlinear programming Benjamin Recht March 11, 2005 The Gameplan Constrained Optimization Convexity Duality Applications/Taxonomy 1 Constrained Optimization minimize f(x) subject to g j (x)
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationPOLYNOMIAL OPTIMIZATION WITH SUMSOFSQUARES INTERPOLANTS
POLYNOMIAL OPTIMIZATION WITH SUMSOFSQUARES 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 informationConvergence rates of momentsumofsquares hierarchies for volume approximation of semialgebraic sets
Convergence rates of momentsumofsquares hierarchies for volume approximation of semialgebraic sets Milan Korda 1, Didier Henrion,3,4 Draft of December 1, 016 Abstract Momentsumofsquares hierarchies
More informationCS675: Convex and Combinatorial Optimization Fall 2016 Convex Optimization Problems. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Fall 2016 Convex Optimization Problems Instructor: Shaddin Dughmi Outline 1 Convex Optimization Basics 2 Common Classes 3 Interlude: Positive SemiDefinite
More informationOn selfconcordant barriers for generalized power cones
On selfconcordant barriers for generalized power cones Scott Roy Lin Xiao January 30, 2018 Abstract In the study of interiorpoint methods for nonsymmetric conic optimization and their applications, Nesterov
More informationPositive semidefinite rank
1/15 Positive semidefinite rank Hamza Fawzi (MIT, LIDS) Joint work with João Gouveia (Coimbra), Pablo Parrilo (MIT), Richard Robinson (Microsoft), James Saunderson (Monash), Rekha Thomas (UW) DIMACS Workshop
More informationSymmetric matrices and dot products
Symmetric matrices and dot products Proposition An n n matrix A is symmetric iff, for all x, y in R n, (Ax) y = x (Ay). Proof. If A is symmetric, then (Ax) y = x T A T y = x T Ay = x (Ay). If equality
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans April 5, 2017 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationMinimizing Cubic and Homogeneous Polynomials over Integers in the Plane
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane Alberto Del Pia Department of Industrial and Systems Engineering & Wisconsin Institutes for Discovery, University of WisconsinMadison
More informationOuterProductFree Sets for Polynomial Optimization and OracleBased Cuts
OuterProductFree Sets for Polynomial Optimization and OracleBased Cuts Daniel Bienstock 1, Chen Chen 1, and Gonzalo Muñoz 1 1 Industrial Engineering & Operations Research, Columbia University, New York,
More informationAn Algorithm for Solving the Convex Feasibility Problem With Linear Matrix Inequality Constraints and an Implementation for SecondOrder Cones
An Algorithm for Solving the Convex Feasibility Problem With Linear Matrix Inequality Constraints and an Implementation for SecondOrder Cones Bryan Karlovitz July 19, 2012 West Chester University of Pennsylvania
More informationCSCI : Optimization and Control of Networks. Review on Convex Optimization
CSCI7000016: Optimization and Control of Networks Review on Convex Optimization 1 Convex set S R n is convex if x,y S, λ,µ 0, λ+µ = 1 λx+µy S geometrically: x,y S line segment through x,y S examples (one
More informationIn English, this means that if we travel on a straight line between any two points in C, then we never leave C.
Convex sets In this section, we will be introduced to some of the mathematical fundamentals of convex sets. In order to motivate some of the definitions, we will look at the closest point problem from
More informationConvex hull of two quadratic or a conic quadratic and a quadratic inequality
Noname manuscript No. (will be inserted by the editor) Convex hull of two quadratic or a conic quadratic and a quadratic inequality Sina Modaresi Juan Pablo Vielma the date of receipt and acceptance should
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 informationConvex Optimization in Classification Problems
New Trends in Optimization and Computational Algorithms December 9 13, 2001 Convex Optimization in Classification Problems Laurent El Ghaoui Department of EECS, UC Berkeley elghaoui@eecs.berkeley.edu 1
More informationMath Matrix Algebra
Math 44  Matrix Algebra Review notes  (Alberto Bressan, Spring 7) sec: Orthogonal diagonalization of symmetric matrices When we seek to diagonalize a general n n matrix A, two difficulties may arise:
More informationA Brief Review on Convex Optimization
A Brief Review on Convex Optimization 1 Convex set S R n is convex if x,y S, λ,µ 0, λ+µ = 1 λx+µy S geometrically: x,y S line segment through x,y S examples (one convex, two nonconvex sets): A Brief Review
More informationSEMIDEFINITE PROGRAM BASICS. Contents
SEMIDEFINITE PROGRAM BASICS BRIAN AXELROD Abstract. A introduction to the basics of Semidefinite programs. Contents 1. Definitions and Preliminaries 1 1.1. Linear Algebra 1 1.2. Convex Analysis (on R n
More informationROBUST ANALYSIS WITH LINEAR MATRIX INEQUALITIES AND POLYNOMIAL MATRICES. Didier HENRION henrion
GRADUATE COURSE ON POLYNOMIAL METHODS FOR ROBUST CONTROL PART IV.1 ROBUST ANALYSIS WITH LINEAR MATRIX INEQUALITIES AND POLYNOMIAL MATRICES Didier HENRION www.laas.fr/ henrion henrion@laas.fr Airbus assembly
More informationLinear Algebra & Analysis Review UW EE/AA/ME 578 Convex Optimization
Linear Algebra & Analysis Review UW EE/AA/ME 578 Convex Optimization January 9, 2015 1 Notation 1. Book pages without explicit citation refer to [1]. 2. R n denotes the set of real ncolumn vectors. 3.
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
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 information