An E cient A ne-scaling Algorithm for Hyperbolic Programming
|
|
- Caroline Gaines
- 5 years ago
- Views:
Transcription
1 An E cient A ne-scaling Algorithm for Hyperbolic Programming Jim Renegar joint work with Mutiara Sondjaja 1
2 Euclidean space A homogeneous polynomial p : E!R is hyperbolic if there is a vector e 2E such that for all x 2E, the univariate polynomial t 7! p(x + te) has only real roots. p is hyperbolic in direction e Example: E S n n, p(x) det(x), E I (identity matrix) then p(x + t E) is the characteristic polynomial of X The hyperbolicity cone ++ is the connected component of {x : p(x) 6 0} containing e. All roots are real because symmetric matrices have only real eigenvalues. For the example, ++ S n n ++ (cone of positive-definite matrices) the convexity of this particular cone is true of hyperbolicity cones in general... 2
3 Thm (Gårding, 15): ++ is a convex cone A hyperbolic program is an optimization problem of the form min hc, xi Ax b x 2 + ; HP closure of ++ Güler (17) introduced hyperbolic programming, motivated largely by the realization that f(x) ln p(x) is a self-concordant barrier function O( p n) iterations to halve the duality gap wheren is the degree of p Güler showed the barrier functions f(x) ln p(x) possess many of the nice properties of X 7! ln det(x) although hyperbolicity cones in general are not symmetric (i.e., self-scaled) 3
4 min hc, xi Ax b x 2 + ; HP There are natural ways in which to relax HP to hyperbolic programs for lower degree polynomials. For example, to obtain a relaxation of SDP... Fix n, and for 1 apple k apple n let k( 1,..., n) : P j 1 <...<j k j 1 j k elementary symmetric polynomial of degree k Then X 7! k ( (X)) is a hyperbolic polynomial in direction E I of degree k, and its hyperbolicity cone contains S n n ++ These polynomials can be evaluated e ciently via the FFT. Perhaps relaxing SDP s in this and related ways will allow larger SDP s to be approximately solved e ciently. The relaxations easily generalize to all hyperbolic programs. 4
5 min hc, xi Ax b x 2 + ; HP barrier function, f(x) ln p(x) its gradient g(x) and Hessian H(x) positive-definite for all x 2 ++ local inner product at e 2 ++ hu, vi e : hu, H(e)vi the induced norm: kvk e p hv, vi e Dikin ellipsoids : Be (e, r) {x : kx ek e apple r} The gist of the original a ne-scaling method due to Dikin is simply: Given a strictly feasible point e for HP and an appropriate value r>0, move from e to the optimal solution e + for min hc, xi Ax b x 2 B e (e, r) Dikin focused on linear programming and chose r 1 (giving the largest Dikin ellipsoids contained in R n +) also: Vanderbei, Meketon and Freedman (186) 5
6 In the mid-180 s, there was considerable e ort trying to prove that Dikin s e-scaling method runs in polynomial-time (perhaps with choice r<1) The e orts mostly ceased when in 186, Shub and Megiddo showed that the infinitesimal version of the algorithm can come near all vertices of a Klee-Minty cube. Nevertheless, several algorithms with spirit similar to Dikin s method have been shown to halve the duality gap in polynomial time: Monteiro, Adler and Resende 10 LP, and convex QP } Jansen, Roos and Terlaky 16 LP 17 PSD LCP-problems Sturm and Zhang 16 SDP Chua 2007 symmetric cone programming These algorithms are primal-dual methods and rely heavily on the cones being self-scaled. use scaling points and V-space } use ellipsoidal cones rather than ellipsoids Our framework shares some strong connections to the one developed by Chek Beng Chua, to whom we are indebted. 6
7 min hc, xi Ax b x 2 + ; HP For e 2 ++ and 0 < < p n,let K e ( ) :{x : he, xi e kxk e } this happens to be the smallest cone containing the Dikin ellipsoid B e e, p n 2 Keep in mind that the cone grows in size as decreases. min hc, xi Ax b x 2 + min hc, xi ; HP! Ax b x 2 K e ( ) ; QP e( ) Definition: Prop: Swath( ) {e 2 ++ : Ae b and QP e ( ) has an optimal solution} Swath(0) Central Path Thus, can be regarded as a measure of the proximity of points in Swath( ) to the central path. 7
8 min hc, xi Ax b x 2 + min hc, xi ; HP! Ax b x 2 K e ( ) ; QP e( ) {x : he, xi e kxk e } Definition: Swath( ) {e 2 ++ : Ae b and QP e ( ) has an optimal solution} Let x e ( ) optimal solution of QP e ( ) (assuming e 2 Swath( )) the main work in computing x e ( ) lies in solving a system of linear equations We assume 0 < <1, in which case + K e ( ) thus,k e ( ) is a relaxation of HP hence, optimal value of HP hc, x e ( )i Current iterate: e 2 ++ Next iterate will be e 0, a convex combination of e and x e ( ) e t e + tx e( ) The choice of t is made through duality... 8
9 min hc, xi Ax b x 2 + min hc, xi ; HP! Ax b x 2 K e ( ) ; QP e( ) {x : he, xi e kxk e } Definition: Swath( ) {e 2 ++ : Ae b and QP e ( ) has an optimal solution} Let x e ( ) optimal solution of QP e ( ) (assuming e 2 Swath( ))
10 min hc, xi Ax b x 2 + min hc, xi ; HP! Ax b x 2 K e ( ) ; QP e( ) {x : he, xi e kxk e } Definition: Swath( ) {e 2 ++ : Ae b and QP e ( ) has an optimal solution} Let x e optimal solution of QP e ( ) (assuming e 2 Swath( )) 10
11 min hc, xi Ax b x 2 + min hc, xi ; HP! Ax b x 2 K e ( ) ; QP e( ) {x : he, xi e kxk e } Definition: Swath( ) {e 2 ++ : Ae b and QP e ( ) has an optimal solution} Let x e optimal solution of QP e ( ) (assuming e 2 Swath( )) max b T y A y + s c s 2 + ; HP! max b T y A y + s c x 2 K e ( ) ; QP e( ) First-order optimality conditions for x e yield optimal solution (y e,s e ) for QP e ( ) Moreover, (y e,s e ) is feasible for HP because + K e ( ) and hence K e ( ) + primal-dual feasible pair: e for HP, (y e,s e ) for HP duality gap: gap e : hc, ei b T y e 11
12 Swath( ) {e 2 ++ : Ae b and QP e ( ) has an optimal solution} x e optimal solution of QP e ( ) (assuming e 2 Swath( )) primal-dual feasible pair: e for HP, (y e,s e ) for HP Current iterate: e 2 ++ Next iterate will be a convex combination of e and x e : e(t) 1 1+t e + tx e Want t to be large so as to improve primal objective value, but also want e(t) 2 Swath( ) We choose t to be the minimizer of a particular quadratic polynomial, and thereby ensure that: e(t) 2 ++ s e 2 int(k e(t) ( ) ) consequently, both e(t) is strictly feasible for QP e(t) ( ) and (y e,s e ) is strictly feasible for QP e(t) ( ) hence, e(t) 2 Swath( ) 12
13 Swath( ) {e 2 ++ : Ae b and QP e ( ) has an optimal solution} x e optimal solution of QP e ( ) (assuming e 2 Swath( )) primal-dual feasible pair: e for HP, (y e,s e ) for HP Current iterate: e 2 ++ Next iterate will be a convex combination of e and x e : e(t) 1 1+t e + tx e Want t to be large so as to improve primal objective value, but also want e(t) 2 Swath( ) We choose t to be the minimizer of a particular quadratic polynomial, and thereby ensure that: t 1 2 /kx ek e and thus ensure good improvement in the primal objective value if, say, kx e k e apple p n 13
14 Swath( ) {e 2 ++ : Ae b and QP e ( ) has an optimal solution} x e optimal solution of QP e ( ) (assuming e 2 Swath( )) primal-dual feasible pair: e for HP, (y e,s e ) for HP Current iterate: e 2 ++ Next iterate will be a convex combination of e and x e : e(t) 1 1+t e + tx e Want t to be large so as to improve primal objective value, but also want e(t) 2 Swath( ) We choose t to be the minimizer of a particular quadratic polynomial, and thereby ensure that: s e 2 K e(t) ( ) where q 1+ 2 whichimpliess e is deep within K e(t) ( ) and hence (y e,s e ) is very strongly feasible for QP e(t) ( ) 14
15 e(t) 1 1+t e + tx e We choose t to be the minimizer of a particular quadratic polynomial, and thereby ensure that: 1. There is good improvement in primal objective value if kx e k e apple p n 2. (y e,s e ) is very strongly feasible for QP e(t) Sequence of iterates: e 0,e 1,e 2,... If i>0, then write x i and (y i,s i ) rather than x ei and (y ei,s ei ) 1. kx i k ei apple p n ) hc, e i+1 i hc, e i i 2. (y i 1,s i 1 ) is very strongly feasible for QP e i On the other hand, we show 3. (kx i k ei p n) ^ (2.) ) b T y i b T y i 1 In this manner we establish the Main Theorem... 15
16 K e ( ) :{x : he, xi e kxk e } Sequence of iterates: e 0,e 1,e 2,... Main Thm: The primal objective value improves monotonically, and so does the dual objective value. If i, k 0, then r! k 1 gap ei 1 1+ gap ei+k 8n e(t) 1 1+t e + tx e We choose t to be the minimizer of a particular quadratic polynomial In fact, the theorem holds if one simply chooses t 1 2 /kx ik ei, but choosing t to be the minimizer can result in steps that are far longer. So what is the particular quadratic polynomial? 16
17 K e ( ) :{x : he, xi e kxk e } Special Case of SDP: E 2 S n n ++, X E optimal for QP E ( ), (y E,S E ) optimal for QP E ( ) Let E(t) 1 1+t (E + tx E) Here is the quadratic polynomial: q(t) : tr ((E + tx E )S E ) 2 Prop: (t 0) ^ (E(t) 0) ) min : S E 2 K E(t) ( ) p n 1/q(t) Prop: The minimizer t of q satisfies t> 1 2 /kx Ek E, E(t) 0 and q(t) apple q Corollary: S E is deep within K E(t) ( ) for the minimizer t of q 17
18 K e ( ) :{x : he, xi e kxk e } Hyperbolic Programming in General: e 2 ++, x e optimal for QP e ( ), (y e,s e ) optimal for QP e ( ) Let e(t) 1 1+t (e + tx e) As happened for SDP, we would like to have an easily computable function q for which (t 0) ^ (e(t) 2 ++ ) ) min : s e 2 K e(t) ( ) p n 1/ q(t) However, in general the resulting function q need not be a quadratic polynomial, nor do we see any reason that it necessarily be e ciently computable in fact, about the most we know is that q is semi algebraic. But we do know how to obtain a quadratic polynomial q which serves as an appropriate upper bound to the function q we do this by leveraging our SDP result with the (very deep) Helton-Vinnikov Theorem for hyperbolicity cones. 18
19 Helton-Vinnikov Theorem: If p : E!R is hyperbolic in direction e and of degree n, and if L is a 3-dimensional subspace of E containing e, then there exists a linear transformation T : L! S n n satisfying T (e) I and p(x) p(e) det(t (x)) for all x 2 L. 1
20 Luckily, the resulting quadratic polynomial always can be e ciently computed: First compute the five leading coe cients, 1, 2, 3, 4 of the univariate polynomial 7! p(x e + e) P n i1 a i i Then compute apple 1 1, apple 2 an 1 2 2, apple 3 an and apple 4 an an an The desired quadratic polynomial is t 7! at 2 + bt + c where a apple 2 1 apple apple 1 apple apple 4, b 2 4 apple 3 2 apple 3 1 and c (n 2 ) apple
21 Epilogue: Recently we learned of a paper on linear programming in which quadratic cones relaxing the non-negative orthant are used in devising a polynomial-time algorithm, albeit one with complexity O(nL) iterations rather than O( p nl) iterations. I.S. Litvinchev, A circular cone relaxation primal interior point algorithm for LP, Optimization 52 (2003)
A QUADRATIC CONE RELAXATION-BASED ALGORITHM FOR LINEAR PROGRAMMING
A QUADRATIC CONE RELAXATION-BASED ALGORITHM FOR LINEAR PROGRAMMING A Dissertation Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements for the
More informationOptimization: Then and Now
Optimization: Then and Now Optimization: Then and Now Optimization: Then and Now Why would a dynamicist be interested in linear programming? Linear Programming (LP) max c T x s.t. Ax b αi T x b i for i
More informationACCELERATED FIRST-ORDER METHODS FOR HYPERBOLIC PROGRAMMING
ACCELERATED FIRST-ORDER METHODS FOR HYPERBOLIC PROGRAMMING JAMES RENEGAR Abstract. A framework is developed for applying accelerated methods to general hyperbolic programming, including linear, second-order
More informationNOTES ON HYPERBOLICITY CONES
NOTES ON HYPERBOLICITY CONES Petter Brändén (Stockholm) pbranden@math.su.se Berkeley, October 2010 1. Hyperbolic programming A hyperbolic program is an optimization problem of the form minimize c T x such
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 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 informationCS711008Z Algorithm Design and Analysis
CS711008Z Algorithm Design and Analysis Lecture 8 Linear programming: interior point method Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 31 Outline Brief
More informationA Primal-Dual Second-Order Cone Approximations Algorithm For Symmetric Cone Programming
A Primal-Dual Second-Order Cone Approximations Algorithm For Symmetric Cone Programming Chek Beng Chua Abstract This paper presents the new concept of second-order cone approximations for convex conic
More informationHYPERBOLIC PROGRAMS, AND THEIR DERIVATIVE RELAXATIONS
HYPERBOLIC PROGRAMS, AND THEIR DERIVATIVE RELAXATIONS JAMES RENEGAR Abstract. We study the algebraic and facial structures of hyperbolic programs, and examine natural relaxations of hyperbolic programs,
More informationSemidefinite Programming
Chapter 2 Semidefinite Programming 2.0.1 Semi-definite programming (SDP) Given C M n, A i M n, i = 1, 2,..., m, and b R m, the semi-definite programming problem is to find a matrix X M n for the optimization
More informationPrimal-Dual Symmetric Interior-Point Methods from SDP to Hyperbolic Cone Programming and Beyond
Primal-Dual Symmetric Interior-Point Methods from SDP to Hyperbolic Cone Programming and Beyond Tor Myklebust Levent Tunçel September 26, 2014 Convex Optimization in Conic Form (P) inf c, x A(x) = b, x
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 informationL. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones. definition. spectral decomposition. quadratic representation. log-det barrier 18-1
L. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones definition spectral decomposition quadratic representation log-det barrier 18-1 Introduction This lecture: theoretical properties of the following
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 informationLecture 5. The Dual Cone and Dual Problem
IE 8534 1 Lecture 5. The Dual Cone and Dual Problem IE 8534 2 For a convex cone K, its dual cone is defined as K = {y x, y 0, x K}. The inner-product can be replaced by x T y if the coordinates of the
More informationInterior Point Methods for Mathematical Programming
Interior Point Methods for Mathematical Programming Clóvis C. Gonzaga Federal University of Santa Catarina, Florianópolis, Brazil EURO - 2013 Roma Our heroes Cauchy Newton Lagrange Early results Unconstrained
More informationA new primal-dual path-following method for convex quadratic programming
Volume 5, N., pp. 97 0, 006 Copyright 006 SBMAC ISSN 00-805 www.scielo.br/cam A new primal-dual path-following method for convex quadratic programming MOHAMED ACHACHE Département de Mathématiques, Faculté
More informationInterior-Point Methods for Linear Optimization
Interior-Point Methods for Linear Optimization Robert M. Freund and Jorge Vera March, 204 c 204 Robert M. Freund and Jorge Vera. All rights reserved. Linear Optimization with a Logarithmic Barrier Function
More informationUsing Schur Complement Theorem to prove convexity of some SOC-functions
Journal of Nonlinear and Convex Analysis, vol. 13, no. 3, pp. 41-431, 01 Using Schur Complement Theorem to prove convexity of some SOC-functions Jein-Shan Chen 1 Department of Mathematics National Taiwan
More informationChapter 6 Interior-Point Approach to Linear Programming
Chapter 6 Interior-Point Approach to Linear Programming Objectives: Introduce Basic Ideas of Interior-Point Methods. Motivate further research and applications. Slide#1 Linear Programming Problem Minimize
More informationA PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE
Yugoslav Journal of Operations Research 24 (2014) Number 1, 35-51 DOI: 10.2298/YJOR120904016K A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE BEHROUZ
More informationInterior Point Methods in Mathematical Programming
Interior Point Methods in Mathematical Programming Clóvis C. Gonzaga Federal University of Santa Catarina, Brazil Journées en l honneur de Pierre Huard Paris, novembre 2008 01 00 11 00 000 000 000 000
More informationE5295/5B5749 Convex optimization with engineering applications. Lecture 5. Convex programming and semidefinite programming
E5295/5B5749 Convex optimization with engineering applications Lecture 5 Convex programming and semidefinite programming A. Forsgren, KTH 1 Lecture 5 Convex optimization 2006/2007 Convex quadratic program
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 informationInterior-point methods Optimization Geoff Gordon Ryan Tibshirani
Interior-point methods 10-725 Optimization Geoff Gordon Ryan Tibshirani SVM duality Review min v T v/2 + 1 T s s.t. Av yd + s 1 0 s 0 max 1 T α α T Kα/2 s.t. y T α = 0 0 α 1 Gram matrix K Interpretation
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 informationPrimal-Dual Interior-Point Methods. Ryan Tibshirani Convex Optimization
Primal-Dual Interior-Point Methods Ryan Tibshirani Convex Optimization 10-725 Given the problem Last time: barrier method min x subject to f(x) h i (x) 0, i = 1,... m Ax = b where f, h i, i = 1,... m are
More informationarxiv:math/ v2 [math.oc] 25 May 2004
arxiv:math/0304104v2 [math.oc] 25 May 2004 THE LAX CONJECTURE IS TRUE A.S. Lewis, P.A. Parrilo, and M.V. Ramana Key words: hyperbolic polynomial, Lax conjecture, hyperbolicity cone, semidefinite representable
More informationInner approximation of convex cones via primal-dual ellipsoidal norms
Inner approximation of convex cones via primal-dual 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 informationAgenda. 1 Duality for LP. 2 Theorem of alternatives. 3 Conic Duality. 4 Dual cones. 5 Geometric view of cone programs. 6 Conic duality theorem
Agenda 1 Duality for LP 2 Theorem of alternatives 3 Conic Duality 4 Dual cones 5 Geometric view of cone programs 6 Conic duality theorem 7 Examples Lower bounds on LPs By eliminating variables (if needed)
More informationLecture 5. Theorems of Alternatives and Self-Dual Embedding
IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c
More informationPrimal-Dual Interior-Point Methods. Ryan Tibshirani Convex Optimization /36-725
Primal-Dual Interior-Point Methods Ryan Tibshirani Convex Optimization 10-725/36-725 Given the problem Last time: barrier method min x subject to f(x) h i (x) 0, i = 1,... m Ax = b where f, h i, i = 1,...
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 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 informationInterior Point Methods: Second-Order Cone Programming and Semidefinite Programming
School of Mathematics T H E U N I V E R S I T Y O H F E D I N B U R G Interior Point Methods: Second-Order Cone Programming and Semidefinite Programming Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio
More informationResearch Note. A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization
Iranian Journal of Operations Research Vol. 4, No. 1, 2013, pp. 88-107 Research Note A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization B. Kheirfam We
More informationPrimal-Dual Interior-Point Methods for Linear Programming based on Newton s Method
Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method Robert M. Freund March, 2004 2004 Massachusetts Institute of Technology. The Problem The logarithmic barrier approach
More informationHYPERBOLIC POLYNOMIALS, INTERLACERS AND SUMS OF SQUARES
HYPERBOLIC POLYNOMIALS, INTERLACERS AND SUMS OF SQUARES DANIEL PLAUMANN Universität Konstanz joint work with Mario Kummer (U. Konstanz) Cynthia Vinzant (U. of Michigan) Out[121]= POLYNOMIAL OPTIMISATION
More informationInterior-point methods Optimization Geoff Gordon Ryan Tibshirani
Interior-point methods 10-725 Optimization Geoff Gordon Ryan Tibshirani SVM duality Review min v T v/2 + 1 T s s.t. Av yd + s 1! 0 s! 0 max 1 T α α T Kα/2 s.t. y T α = 0 0 " α " 1 Gram matrix K Interpretation
More informationAdvanced Mathematical Programming IE417. Lecture 24. Dr. Ted Ralphs
Advanced Mathematical Programming IE417 Lecture 24 Dr. Ted Ralphs IE417 Lecture 24 1 Reading for This Lecture Sections 11.2-11.2 IE417 Lecture 24 2 The Linear Complementarity Problem Given M R p p and
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 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 informationPrimal-Dual Interior-Point Methods. Javier Peña Convex Optimization /36-725
Primal-Dual Interior-Point Methods Javier Peña Convex Optimization 10-725/36-725 Last time: duality revisited Consider the problem min x subject to f(x) Ax = b h(x) 0 Lagrangian L(x, u, v) = f(x) + u T
More informationA full-newton step infeasible interior-point algorithm for linear programming based on a kernel function
A full-newton step infeasible interior-point algorithm for linear programming based on a kernel function Zhongyi Liu, Wenyu Sun Abstract This paper proposes an infeasible interior-point algorithm with
More informationA Generalized Homogeneous and Self-Dual Algorithm. for Linear Programming. February 1994 (revised December 1994)
A Generalized Homogeneous and Self-Dual Algorithm for Linear Programming Xiaojie Xu Yinyu Ye y February 994 (revised December 994) Abstract: A generalized homogeneous and self-dual (HSD) infeasible-interior-point
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 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 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 informationSF2822 Applied nonlinear optimization, final exam Wednesday June
SF2822 Applied nonlinear optimization, final exam Wednesday June 3 205 4.00 9.00 Examiner: Anders Forsgren, tel. 08-790 7 27. Allowed tools: Pen/pencil, ruler and eraser. Note! Calculator is not allowed.
More informationAdvances in Convex Optimization: Theory, Algorithms, and Applications
Advances in Convex Optimization: Theory, Algorithms, and Applications Stephen Boyd Electrical Engineering Department Stanford University (joint work with Lieven Vandenberghe, UCLA) ISIT 02 ISIT 02 Lausanne
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 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 informationAn Infeasible Interior-Point Algorithm with full-newton Step for Linear Optimization
An Infeasible Interior-Point Algorithm with full-newton Step for Linear Optimization H. Mansouri M. Zangiabadi Y. Bai C. Roos Department of Mathematical Science, Shahrekord University, P.O. Box 115, Shahrekord,
More informationl p -Norm Constrained Quadratic Programming: Conic Approximation Methods
OUTLINE l p -Norm Constrained Quadratic Programming: Conic Approximation Methods Wenxun Xing Department of Mathematical Sciences Tsinghua University, Beijing Email: wxing@math.tsinghua.edu.cn OUTLINE OUTLINE
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 informationAn O(nL) Infeasible-Interior-Point Algorithm for Linear Programming arxiv: v2 [math.oc] 29 Jun 2015
An O(nL) Infeasible-Interior-Point Algorithm for Linear Programming arxiv:1506.06365v [math.oc] 9 Jun 015 Yuagang Yang and Makoto Yamashita September 8, 018 Abstract In this paper, we propose an arc-search
More informationLinear and non-linear programming
Linear and non-linear 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 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 informationPrimal-Dual Geometry of Level Sets and their Explanatory Value of the Practical Performance of Interior-Point Methods for Conic Optimization
Primal-Dual Geometry of Level Sets and their Explanatory Value of the Practical Performance of Interior-Point Methods for Conic Optimization Robert M. Freund M.I.T. June, 2010 from papers in SIOPT, Mathematics
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 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 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 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 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 Optimization and l 1 -minimization
Convex Optimization and l 1 -minimization Sangwoon Yun Computational Sciences Korea Institute for Advanced Study December 11, 2009 2009 NIMS Thematic Winter School Outline I. Convex Optimization II. l
More informationSecond-order cone programming
Outline Second-order cone programming, PhD Lehigh University Department of Industrial and Systems Engineering February 10, 2009 Outline 1 Basic properties Spectral decomposition The cone of squares The
More informationLagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)
Lagrange Duality Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Lagrangian Dual function Dual
More informationNew Infeasible Interior Point Algorithm Based on Monomial Method
New Infeasible Interior Point Algorithm Based on Monomial Method Yi-Chih Hsieh and Dennis L. Bricer Department of Industrial Engineering The University of Iowa, Iowa City, IA 52242 USA (January, 1995)
More informationLecture 14: Optimality Conditions for Conic Problems
EE 227A: Conve Optimization and Applications March 6, 2012 Lecture 14: Optimality Conditions for Conic Problems Lecturer: Laurent El Ghaoui Reading assignment: 5.5 of BV. 14.1 Optimality for Conic Problems
More informationConvex sets, conic matrix factorizations and conic rank lower bounds
Convex sets, conic matrix factorizations and conic rank lower bounds Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute
More 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 informationLecture 9 Monotone VIs/CPs Properties of cones and some existence results. October 6, 2008
Lecture 9 Monotone VIs/CPs Properties of cones and some existence results October 6, 2008 Outline Properties of cones Existence results for monotone CPs/VIs Polyhedrality of solution sets Game theory:
More informationIII. Applications in convex optimization
III. Applications in convex optimization nonsymmetric interior-point methods partial separability and decomposition partial separability first order methods interior-point methods Conic linear optimization
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 4
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 4 Instructor: Farid Alizadeh Scribe: Haengju Lee 10/1/2001 1 Overview We examine the dual of the Fermat-Weber Problem. Next we will
More informationLecture: Introduction to LP, SDP and SOCP
Lecture: Introduction to LP, SDP and SOCP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2015.html wenzw@pku.edu.cn Acknowledgement:
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 informationCOM S 578X: Optimization for Machine Learning
COM S 578X: Optimization for Machine Learning Lecture Note 4: Duality Jia (Kevin) Liu Assistant Professor Department of Computer Science Iowa State University, Ames, Iowa, USA Fall 2018 JKL (CS@ISU) COM
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 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 informationNonsymmetric potential-reduction methods for general cones
CORE DISCUSSION PAPER 2006/34 Nonsymmetric potential-reduction methods for general cones Yu. Nesterov March 28, 2006 Abstract In this paper we propose two new nonsymmetric primal-dual potential-reduction
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 informationMath 413/513 Chapter 6 (from Friedberg, Insel, & Spence)
Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) David Glickenstein December 7, 2015 1 Inner product spaces In this chapter, we will only consider the elds R and C. De nition 1 Let V be a vector
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 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 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 informationFollowing The Central Trajectory Using The Monomial Method Rather Than Newton's Method
Following The Central Trajectory Using The Monomial Method Rather Than Newton's Method Yi-Chih Hsieh and Dennis L. Bricer Department of Industrial Engineering The University of Iowa Iowa City, IA 52242
More informationDuality revisited. Javier Peña Convex Optimization /36-725
Duality revisited Javier Peña Conve Optimization 10-725/36-725 1 Last time: barrier method Main idea: approimate the problem f() + I C () with the barrier problem f() + 1 t φ() tf() + φ() where t > 0 and
More informationFacial Reduction and Geometry on Conic Programming
Facial Reduction and Geometry on Conic Programming Masakazu Muramatsu UEC Bruno F. Lourenço, and Takashi Tsuchiya Seikei University GRIPS Based on the papers of LMT: 1. A structural geometrical analysis
More informationConvex Optimization 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Convex Optimization 1 Many optimization objectives generated
More informationA Quantum Interior Point Method for LPs and SDPs
A Quantum Interior Point Method for LPs and SDPs Iordanis Kerenidis 1 Anupam Prakash 1 1 CNRS, IRIF, Université Paris Diderot, Paris, France. September 26, 2018 Semi Definite Programs A Semidefinite Program
More informationThe reverse Hlawka inequality in a Minkowski space
The reverse Hlawka inequality in a Minkowski space Denis Serre UMPA, UMR CNRS ENS Lyon # 5669 École Normale Supérieure de Lyon 46, allée d Italie, F 69364 Lyon, cedex 07 October 9, 2014 1 Motivation and
More informationNew stopping criteria for detecting infeasibility in conic optimization
Optimization Letters manuscript No. (will be inserted by the editor) New stopping criteria for detecting infeasibility in conic optimization Imre Pólik Tamás Terlaky Received: March 21, 2008/ Accepted:
More informationLP Duality: outline. Duality theory for Linear Programming. alternatives. optimization I Idea: polyhedra
LP Duality: outline I Motivation and definition of a dual LP I Weak duality I Separating hyperplane theorem and theorems of the alternatives I Strong duality and complementary slackness I Using duality
More informationLECTURE 13 LECTURE OUTLINE
LECTURE 13 LECTURE OUTLINE Problem Structures Separable problems Integer/discrete problems Branch-and-bound Large sum problems Problems with many constraints Conic Programming Second Order Cone Programming
More informationSupplement: Universal Self-Concordant Barrier Functions
IE 8534 1 Supplement: Universal Self-Concordant Barrier Functions IE 8534 2 Recall that a self-concordant barrier function for K is a barrier function satisfying 3 F (x)[h, h, h] 2( 2 F (x)[h, h]) 3/2,
More informationSparse Optimization Lecture: Dual Certificate in l 1 Minimization
Sparse Optimization Lecture: Dual Certificate in l 1 Minimization Instructor: Wotao Yin July 2013 Note scriber: Zheng Sun Those who complete this lecture will know what is a dual certificate for l 1 minimization
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 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 informationExact algorithms: from Semidefinite to Hyperbolic programming
Exact algorithms: from Semidefinite to Hyperbolic programming Simone Naldi and Daniel Plaumann PGMO Days 2017 Nov 14 2017 - EDF Lab Paris Saclay 1 Polyhedra P = {x R n : i, l i (x) 0} Finite # linear inequalities
More informationLecture 17: Primal-dual interior-point methods part II
10-725/36-725: Convex Optimization Spring 2015 Lecture 17: Primal-dual interior-point methods part II Lecturer: Javier Pena Scribes: Pinchao Zhang, Wei Ma Note: LaTeX template courtesy of UC Berkeley EECS
More information