Fast ADMM for Sum of Squares Programs Using Partial Orthogonality
|
|
- Junior Pierce
- 6 years ago
- Views:
Transcription
1 Fast ADMM for Sum of Squares Programs Using Partial Orthogonality Antonis Papachristodoulou Department of Engineering Science University of Oxford with Yang Zheng (U Oxford) and Giovanni Fantuzzi (Imperial CL)
2 OULINE 1 Introduction SOS programs, SDPs and partial orthogonality 3 A fast ADMM algorithm 4 Numerical examples 5 Conclusion
3 OULINE 1 Introduction SOS programs, SDPs and partial orthogonality 3 A fast ADMM algorithm 4 Numerical examples 5 Conclusion
4 5. Conclusion Polynomial Optimisation Is px ( ) = px α 0? α Unconstrained polynomial optimisation α min p( x) x n max x n γ s.t. px ( ) γ 0 p( x) γ x Other areas: graph partition, matrix copositivity test, etc.
5 Analysis in Dynamical Systems Lyapunov: x = f( x), f(0) = 0, f Lipschitz, n xt ( ) D x, 0 D If V : D R cont. differentiable s.t. V(0) = 0, and V( x) > 0 in D\ {0} V( x) V ( x) = f( x) > 0 in D\{0} x then x = 0 is asymptotically stable. V(x) n R Checking if p( x) 0 is NP-hard when deg( p) 4, p [ x].
6 Positive Polynomials and Sum of Squares Shor: px ( ) is Sum of Squares px ( ) is positive semi-definite m = qi ( x) px i = 1 px ( ) ( ) 0 Worst-case polynomial NP-hard when deg( p) 4 time complexity Can be solved using semidefinite programming (SDP) (Parrilo), which can be setup and solved using SOSOOLS: Can also search for unknown coefficients of p( x) so that px ( ) is SOS P., Anderson, Valmorbida, Prajna, Seiler, Parrilo, 013
7 SOSOOLS Formulates and solves the equivalent semidefinite programme (SDP) SOSOOLS SOS program SOSP solution SDP SDP solution SeDuMi SDP3 CSDP SDPNAL SDPA SOSOOLS
8 x Van der Pol Oscillator = x 1 x = x (1 x ) x 1 1
9 Sum of Squares and Semidefinite Programming m ( ) = qi ( x) = vd( x) Xvd( x) i = 1 px Proposition: p is SOS X 0, v ( x) monomials of degree d deg( p) Example: p( x, x ) = 5x + x x x x x x x X v d ( x) x q q q x = x q q q x xx q q q xx i i Expand out and match coefficients: q = 5, q =, q + q = 1, q = 1, q = Require that X 0
10 What restricts SOS methods? Computation m ( ) i ( ) d( ) d( ), i = 1 px = q x = v x Xv x x { α n α } d v ( x) = x d n+ d 1 x x x x x x x, of size. d d = 1 n 1 1 n Reduce the size of v d (x)? Newton polytope, diagonal inconsistency, symmetry properties, and facial reduction Alternative formulation (DSOS/SDSOS), leading to linear programs (LPs) or second-order-cone programs (SOCPs) Solving the SDPs by more scalable first-order methods (FOMs) at the cost of reduced accuracy. n
11 OULINE 1 Introduction SOS programs, SDPs and partial orthogonality 3 A fast ADMM algorithm 4 Numerical examples 5 Conclusion
12 5. Conclusion Formalism t sx ( ) g( x) ug( x) is SOS = 0 i = 1 iff s( x) = v ( x) Xv ( x) = X, v ( x) v ( x), X 0 d d d d 1 if β + γ = α Indicator matrices ( Bα ) βγ, = 0 otherwise hen v ( x) v ( x) B x = d d α t α And therefore g0, α ug i i, α x = Bα, X x α i = 1 α t Coefficient Matching Conditions g0, α ug i i, α = Bα, X i = 1 i i α α α
13 5. Conclusion Our strategy min wu s. t. sx ( ) = g( x) ug( x), 0 min wu t t n i i Bα X + ug i i, α = g0, α, α d i = 1 i = 1 s Σ[ x] X 0 s. t.,,, Size of the SDP Partial orthogonality in the resulting Semidefinite Programme A fast first order (ADMM) algorithm that exploits the partial orthogonality trades accuracy for scalability. Implemented in CDCS-sos, downloadable
14 5. Conclusion Standard SDP formulation A Notation min wu Standard SDP formulation t n α + i i, α = 0, α, α d i = 1 s. t. B, X ug g,, X 0 g1,1 gt,1 vec( B1 ) =, A = 1 g1, m g t, m vec( Bm) min ξ c ξ s. t. Aξ = b, ξ K A A A R m ( t+ N ) [ 1 ], m b [ g,, g ] R, 0,1 0, m t+ N c [ w,0,,0] R, ξ K t+ N [ u, vec( X) ] R, R t S +
15 5. Conclusion Standard SDP formulation min ξ c ξ s. t. Aξ = b, ξ K A g1,1 gt,1 vec( B1 ) =, A = 1 g1, m g t, m vec( Bm) m A [ A A ] R + 1 ( t N ) 1 he density of nonzero elements in is O. n A d AA is diagonal. he m m matrix AA is of "diagonal plus low rank" form.
16 Partial Orthogonality g1,1 gt,1 vec( B1 ) t g0, α ug i i, α = Bα, A1 =, A = i = 1 g1, m g t, m vec( Bm) AA 1 1 AA 1. D. Bertsimas, R. M. Freund, and X. A. Sun, An accelerated first order method for solving sos relaxations of unconstrained polynomial optimization problems, Optimization Methods and Software, vol. 8, no. 3, pp , D. Henrion and J. Malick, Projection methods in conic optimization, in Handbook on Semidefinite, Conic and Polynomial Optimization. Springer, 01, pp
17 OULINE 1 Introduction SOS programs, SDPs and partial orthogonality 3 A fast ADMM algorithm 4 Numerical examples 5 Conclusion
18 ADMM for the homogeneous self-dual embedding 3. ADMM for the Homogenous Self dual Embedding min ξ s.t. min c ξ wu Aξ = b ξ K t n α + i i, α = 0, α, α d i = 1 s. t. B, X ug g,, X 0 max y s.t. by Ay z c z + = K KK conditions Primal feasibility Aξ = b, ξ K Dual feasibility A y + z = c, z K Zero-duality gap c ξ b y = 0 z 0 A c ξ s = A 0 b y κ c b 0 τ
19 ADMM for the Homogeneous self-dual embedding 3. ADMM for the Homogenous Self dual Embedding z 0 A c ξ s = A 0 b y κ c b 0 τ τ, κ are two non-negative and complementary variables Notational simplicity z ξ 0 A c m v s, u y, Q A 0 b, C = K R R κ τ c b 0 + Feasibility problem find ( uv, ) s.t. v = Qu ( uv, ) C C
20 ADMM for the Homogeneous self-dual embedding find ( uv, ) s.t. v = Qu, ( u, v) C C ADMM steps (similar to solver SCS [1]) k+ 1 1 k k ˆ ( ) ( ) u = I + Q u + v k+ 1 k+ 1 k u = P( uˆ v ) C v = v uˆ + u k+ 1 k k+ 1 k+ 1 Affine projection Conic projection 0 A c Q A 0 b c b 0 Affine projection takes advantage of diagonal plus low rank for efficient computation [1] O Donoghue, B., Chu, E., Parikh, N. and Boyd, S. (016). Conic optimization via operator splitting and homogeneous self-dual embedding. Journal of Optimization heory and Applications, 169(3),
21 ADMM for the Homogeneous self-dual embedding k+ 1 1 k k ˆ ( ) ( ) u = I + Q u + v k+ 1 k+ 1 k u = P( uˆ v ) C v = v uˆ + u k+ 1 k k+ 1 k+ 1 Affine projection i i i In affine projection, one needs to invert/factorize m m I + AA R Recall that AA is "diagonal plus low rank" ( I + AA ) = ( P + AA ) = P P A( I + A P A) A P t t I + A P A R 1 1 Since in typical SOS programs t m, partial orthogonality can provide a speed-up in the affine projection.
22 OULINE 1 Introduction SOS programs, SDPs and partial orthogonality 3 A fast ADMM algorithm 4 Numerical examples 5 Conclusion
23 CDCS: Cone Decomposition Conic Solver 4. CDCS: Cone Decomposition Conic Solver An open source MALAB solver for partially decomposable conic programs; CDCS supports constraints on the following cones: Free variables non-negative orthant second-order cone the positive semidefinite cone. Input-output format is aligned with SeDuMi; SOS module can be invoked with option sos Works with latest YALMIP release. Syntax: [x,y,z,info] = cdcs(at,b,c,k,opts); Download from
24 5. Conclusion Numerical Examples Implemented in CDCS, invoked by the option sos Compared to SCS and SeDuMi, SDPA, SDP3 Stopping condition for CDCS and SCS: ε = 10-4, 000 iterations min ( xx + x x x 3 x x ) x i j i j j i j 1 < i j n n s. t. x 1 i i = 1
25 5. Conclusion Numerical Examples min ( xx + x x x 3 x x ) x i j i j j i j 1 < i j n n s. t. x 1 i i = 1
26 5. Conclusion Lyapunov function construction Randomly generated polynomial dynamical systems of degree three with a locally asymptotically stable equilibrium at the origin.
27 5. Conclusion Nuclear Receptor Signalling ested our algorithm on a model of nuclear receptor signalling. he model has 37 states, and a cubic vector field ested local stability in the ball with radius 0.01 Constructing a quadratic Lyapunov function Dimension of the resulting SDP: Cone size: K.s = [ ], K.f = 1406; Number of constraints: , the size of A:, (5535 is the number of variables) Interior point solvers First-order solvers SeDuMi SDP3 SDPA CSDP SCS CDCS Failed Failed Failed Failed 151 s 57.3 s Failed: Out of memory Numerical results on a PC with.8 GHz Intel Core i7 and 8 GB of RAM
28 OULINE 1 Introduction SOS programs, SDPs and partial orthogonality 3 A fast ADMM algorithm 4 Numerical examples 5 Conclusion
29 5. Conclusion Conclusions SOS programs have found in a wide range of applications, e.g. polynomial optimization problems and nonlinear systems analysis questions. One fundamental challenge is the poor scalability of SOS programs to large instances Fortunately, the resulting SDPs are highly sparse and structured, (partial orthogonality in this talk) We have developed a fast ADMM algorithm to solve this class of SDPs at the cost of reduced accuracy. CDCS: Download from
30 hank you for your attention! Q & A 1. Zheng, Y., Fantuzzi, G., & Papachristodoulou, A. (017). Fast ADMM for sum of squares programs using partial orthogonality. arxiv preprint arxiv: Zheng, Yang, Giovanni Fantuzzi, and Antonis Papachristodoulou. "Exploiting Sparsity in the Coefficient Matching Conditions in Sum of Squares Programming using ADMM." IEEE Control Systems Letters (017). Paper hb03.3
Distributed Control of Connected Vehicles and Fast ADMM for Sparse SDPs
Distributed Control of Connected Vehicles and Fast ADMM for Sparse SDPs Yang Zheng Department of Engineering Science, University of Oxford Homepage: http://users.ox.ac.uk/~ball4503/index.html Talk at Cranfield
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 informationExploiting Structure in SDPs with Chordal Sparsity
Exploitig Structure i SDPs with Chordal Sparsity Atois Papachristodoulou Departmet of Egieerig Sciece, Uiversity of Oxford Joit work with Yag Zheg, Giovai Fatuzzi, Paul Goulart ad Adrew Wy CDC 06 Pre-coferece
More informationDSOS/SDOS Programming: New Tools for Optimization over Nonnegative Polynomials
DSOS/SDOS Programming: New Tools for Optimization over Nonnegative Polynomials Amir Ali Ahmadi Princeton University Dept. of Operations Research and Financial Engineering (ORFE) Joint work with: Anirudha
More informationDimension reduction for semidefinite programming
1 / 22 Dimension reduction for semidefinite programming Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
More informationOptimization 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 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 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 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 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 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 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 informationCroatian Operational Research Review (CRORR), Vol. 3, 2012
126 127 128 129 130 131 132 133 REFERENCES [BM03] S. Burer and R.D.C. Monteiro (2003), A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Mathematical Programming
More informationThe Graph Realization Problem
The Graph Realization Problem via Semi-Definite Programming A. Y. Alfakih alfakih@uwindsor.ca Mathematics and Statistics University of Windsor The Graph Realization Problem p.1/21 The Graph Realization
More informationSparse Optimization Lecture: Basic Sparse Optimization Models
Sparse Optimization Lecture: Basic Sparse Optimization Models Instructor: Wotao Yin July 2013 online discussions on piazza.com Those who complete this lecture will know basic l 1, l 2,1, and nuclear-norm
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 informationAnalysis and synthesis: a complexity perspective
Analysis and synthesis: a complexity perspective Pablo A. Parrilo ETH ZürichZ control.ee.ethz.ch/~parrilo Outline System analysis/design Formal and informal methods SOS/SDP techniques and applications
More informationSparse Matrix Theory and Semidefinite Optimization
Sparse Matrix Theory and Semidefinite Optimization Lieven Vandenberghe Department of Electrical Engineering University of California, Los Angeles Joint work with Martin S. Andersen and Yifan Sun Third
More informationLecture 6: Conic Optimization September 8
IE 598: Big Data Optimization Fall 2016 Lecture 6: Conic Optimization September 8 Lecturer: Niao He Scriber: Juan Xu Overview In this lecture, we finish up our previous discussion on optimality conditions
More informationIterative LP and SOCP-based. approximations to. sum of squares programs. Georgina Hall Princeton University. Joint work with:
Iterative LP and SOCP-based approximations to sum of squares programs Georgina Hall Princeton University Joint work with: Amir Ali Ahmadi (Princeton University) Sanjeeb Dash (IBM) Sum of squares programs
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 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 informationThe maximal stable set problem : Copositive programming and Semidefinite Relaxations
The maximal stable set problem : Copositive programming and Semidefinite Relaxations Kartik Krishnan Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy, NY 12180 USA kartis@rpi.edu
More 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 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 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 informationFast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma
Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 8 September 2003 European Union RTN Summer School on Multi-Agent
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 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 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 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 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 informationLecture 7: Convex Optimizations
Lecture 7: Convex Optimizations Radu Balan, David Levermore March 29, 2018 Convex Sets. Convex Functions A set S R n is called a convex set if for any points x, y S the line segment [x, y] := {tx + (1
More informationSOSTOOLS. Sum of Squares Optimization Toolbox for MATLAB. User s guide. Version st July University of Oxford Oxford, U.K.
SOSTOOLS Sum of Squares Optimization Toolbox for MATLAB User s guide Version 3.01 1st July 2016 Antonis Papachristodoulou 1 James Anderson 1 Giorgio Valmorbida 2 Stephen Prajna Peter Seiler 4 Pablo A.
More informationAn accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems The MIT Faculty has made this article openly available. Please share how this access benefits
More informationarxiv: v1 [math.oc] 26 Sep 2015
arxiv:1509.08021v1 [math.oc] 26 Sep 2015 Degeneracy in Maximal Clique Decomposition for Semidefinite Programs Arvind U. Raghunathan and Andrew V. Knyazev Mitsubishi Electric Research Laboratories 201 Broadway,
More information16.1 L.P. Duality Applied to the Minimax Theorem
CS787: Advanced Algorithms Scribe: David Malec and Xiaoyong Chai Lecturer: Shuchi Chawla Topic: Minimax Theorem and Semi-Definite Programming Date: October 22 2007 In this lecture, we first conclude our
More informationAnalytical Validation Tools for Safety Critical Systems
Analytical Validation Tools for Safety Critical Systems Peter Seiler and Gary Balas Department of Aerospace Engineering & Mechanics, University of Minnesota, Minneapolis, MN, 55455, USA Andrew Packard
More informationPre- and Post-processing Sum-of-squares Programs in Practice
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL X, NO X, JANUARY 00X Pre- and Post-processing Sum-of-squares Programs in Practice Johan Löfberg Abstract Checking non-negativity of polynomials using sum-ofsquares
More informationCSCI 1951-G Optimization Methods in Finance Part 10: Conic Optimization
CSCI 1951-G 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 informationA CONIC DANTZIG-WOLFE DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING
A CONIC DANTZIG-WOLFE DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING Kartik Krishnan Advanced Optimization Laboratory McMaster University Joint work with Gema Plaza Martinez and Tamás
More informationLecture 6 Verification of Hybrid Systems
Lecture 6 Verification of Hybrid Systems Ufuk Topcu Nok Wongpiromsarn Richard M. Murray AFRL, 25 April 2012 Outline: A hybrid system model Finite-state abstractions and use of model checking Deductive
More informationA PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS
A PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS Kartik K. Sivaramakrishnan Department of Mathematics North Carolina State University kksivara@ncsu.edu http://www4.ncsu.edu/
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 informationConverse Results on Existence of Sum of Squares Lyapunov Functions
2011 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) Orlando, FL, USA, December 12-15, 2011 Converse Results on Existence of Sum of Squares Lyapunov Functions Amir
More informationDistributed Stability Analysis and Control of Dynamic Networks
Distributed Stability Analysis and Control of Dynamic Networks M. Anghel and S. Kundu Los Alamos National Laboratory, USA August 4, 2015 Anghel & Kundu (LANL) Distributed Analysis & Control of Networks
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 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 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 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 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 informationThe Q Method for Symmetric Cone Programmin
The Q Method for Symmetric Cone Programming The Q Method for Symmetric Cone Programmin Farid Alizadeh and Yu Xia alizadeh@rutcor.rutgers.edu, xiay@optlab.mcma Large Scale Nonlinear and Semidefinite Progra
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 informationA PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS IN POLYNOMIAL OPTIMIZATION
A PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS IN POLYNOMIAL OPTIMIZATION Kartik K. Sivaramakrishnan Department of Mathematics North Carolina State University
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 informationAsynchronous Algorithms for Conic Programs, including Optimal, Infeasible, and Unbounded Ones
Asynchronous Algorithms for Conic Programs, including Optimal, Infeasible, and Unbounded Ones Wotao Yin joint: Fei Feng, Robert Hannah, Yanli Liu, Ernest Ryu (UCLA, Math) DIMACS: Distributed Optimization,
More informationSPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
Journal of the Operations Research Society of Japan 2008, Vol. 51, No. 3, 241-264 SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS Kazuhiro Kobayashi Sunyoung Kim Masakazu
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationINTERIOR-POINT METHODS ROBERT J. VANDERBEI JOINT WORK WITH H. YURTTAN BENSON REAL-WORLD EXAMPLES BY J.O. COLEMAN, NAVAL RESEARCH LAB
1 INTERIOR-POINT METHODS FOR SECOND-ORDER-CONE AND SEMIDEFINITE PROGRAMMING ROBERT J. VANDERBEI JOINT WORK WITH H. YURTTAN BENSON REAL-WORLD EXAMPLES BY J.O. COLEMAN, NAVAL RESEARCH LAB Outline 2 Introduction
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 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 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 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 informationA PARALLEL TWO-STAGE INTERIOR POINT DECOMPOSITION ALGORITHM FOR LARGE SCALE STRUCTURED SEMIDEFINITE PROGRAMS
A PARALLEL TWO-STAGE INTERIOR POINT DECOMPOSITION ALGORITHM FOR LARGE SCALE STRUCTURED SEMIDEFINITE PROGRAMS Kartik K. Sivaramakrishnan Research Division Axioma, Inc., Atlanta kksivara@axiomainc.com http://www4.ncsu.edu/
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 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 informationA semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint
Iranian Journal of Operations Research Vol. 2, No. 2, 20, pp. 29-34 A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint M. Salahi Semidefinite
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 informationRegion of attraction approximations for polynomial dynamical systems
Region of attraction approximations for polynomial dynamical systems Milan Korda EPFL Lausanne Didier Henrion LAAS-CNRS Toulouse & CTU Prague Colin N. Jones EPFL Lausanne Region of Attraction (ROA) ẋ(t)
More informationMIT Algebraic techniques and semidefinite optimization February 14, Lecture 3
MI 6.97 Algebraic techniques and semidefinite optimization February 4, 6 Lecture 3 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture, we will discuss one of the most important applications
More informationConvex Optimization. (EE227A: UC Berkeley) Lecture 6. Suvrit Sra. (Conic optimization) 07 Feb, 2013
Convex Optimization (EE227A: UC Berkeley) Lecture 6 (Conic optimization) 07 Feb, 2013 Suvrit Sra Organizational Info Quiz coming up on 19th Feb. Project teams by 19th Feb Good if you can mix your research
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 informationEE 227A: Convex Optimization and Applications October 14, 2008
EE 227A: Convex Optimization and Applications October 14, 2008 Lecture 13: SDP Duality Lecturer: Laurent El Ghaoui Reading assignment: Chapter 5 of BV. 13.1 Direct approach 13.1.1 Primal problem Consider
More informationConic optimization under combinatorial sparsity constraints
Conic optimization under combinatorial sparsity constraints Christoph Buchheim and Emiliano Traversi Abstract We present a heuristic approach for conic optimization problems containing sparsity constraints.
More informationProjection methods for conic feasibility problems; applications to sum-of-squares decompositions
Projection methods for conic feasibility problems; applications to sum-of-squares decompositions Didier Henrion, Jérôme Malick To cite this version: Didier Henrion, Jérôme Malick. Projection methods for
More informationUses of duality. Geoff Gordon & Ryan Tibshirani Optimization /
Uses of duality Geoff Gordon & Ryan Tibshirani Optimization 10-725 / 36-725 1 Remember conjugate functions Given f : R n R, the function is called its conjugate f (y) = max x R n yt x f(x) Conjugates appear
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 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 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 informationPolynomial level-set methods for nonlinear dynamical systems analysis
Proceedings of the Allerton Conference on Communication, Control and Computing pages 64 649, 8-3 September 5. 5.7..4 Polynomial level-set methods for nonlinear dynamical systems analysis Ta-Chung Wang,4
More informationRelaxations and Randomized Methods for Nonconvex QCQPs
Relaxations and Randomized Methods for Nonconvex QCQPs Alexandre d Aspremont, Stephen Boyd EE392o, Stanford University Autumn, 2003 Introduction While some special classes of nonconvex problems can be
More informationm i=1 c ix i i=1 F ix i F 0, X O.
What is SDP? for a beginner of SDP Copyright C 2005 SDPA Project 1 Introduction This note is a short course for SemiDefinite Programming s SDP beginners. SDP has various applications in, for example, control
More informationSemidefinite programming lifts and sparse sums-of-squares
1/15 Semidefinite programming lifts and sparse sums-of-squares Hamza Fawzi (MIT, LIDS) Joint work with James Saunderson (UW) and Pablo Parrilo (MIT) Cornell ORIE, October 2015 Linear optimization 2/15
More 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 informationLecture: Algorithms for LP, SOCP and SDP
1/53 Lecture: Algorithms for 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 informationConstructing Lyapunov-Krasovskii Functionals For Linear Time Delay Systems
Constructing Lyapunov-Krasovskii Functionals For Linear Time Delay Systems Antonis Papachristodoulou, Matthew Peet and Sanjay Lall Abstract We present an algorithmic methodology for constructing Lyapunov-Krasovskii
More informationConvex computation of the region of attraction for polynomial control systems
Convex computation of the region of attraction for polynomial control systems Didier Henrion LAAS-CNRS Toulouse & CTU Prague Milan Korda EPFL Lausanne Region of Attraction (ROA) ẋ = f (x,u), x(t) X, u(t)
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 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 information15. Conic optimization
L. Vandenberghe EE236C (Spring 216) 15. Conic optimization conic linear program examples modeling duality 15-1 Generalized (conic) inequalities Conic inequality: a constraint x K where K is a convex cone
More informationDegeneracy in Maximal Clique Decomposition for Semidefinite Programs
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Degeneracy in Maximal Clique Decomposition for Semidefinite Programs Raghunathan, A.U.; Knyazev, A. TR2016-040 July 2016 Abstract Exploiting
More informationAgenda. Interior Point Methods. 1 Barrier functions. 2 Analytic center. 3 Central path. 4 Barrier method. 5 Primal-dual path following algorithms
Agenda Interior Point Methods 1 Barrier functions 2 Analytic center 3 Central path 4 Barrier method 5 Primal-dual path following algorithms 6 Nesterov Todd scaling 7 Complexity analysis Interior point
More information10725/36725 Optimization Homework 4
10725/36725 Optimization Homework 4 Due November 27, 2012 at beginning of class Instructions: There are four questions in this assignment. Please submit your homework as (up to) 4 separate sets of pages
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-284 Research Reports on Mathematical and Computing Sciences Exploiting Sparsity in Linear and Nonlinear Matrix Inequalities via Positive Semidefinite Matrix Completion Sunyoung Kim, Masakazu
More informationA Simple Derivation of a Facial Reduction Algorithm and Extended Dual Systems
A Simple Derivation of a Facial Reduction Algorithm and Extended Dual Systems Gábor Pataki gabor@unc.edu Dept. of Statistics and OR University of North Carolina at Chapel Hill Abstract The Facial Reduction
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 informationLecture 20: November 1st
10-725: Optimization Fall 2012 Lecture 20: November 1st Lecturer: Geoff Gordon Scribes: Xiaolong Shen, Alex Beutel Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer: These notes have not
More informationA Julia JuMP-based module for polynomial optimization with complex variables applied to ACOPF
JuMP-dev workshop 018 A Julia JuMP-based module for polynomial optimization with complex variables applied to ACOPF Gilles Bareilles, Manuel Ruiz, Julie Sliwak 1. MathProgComplex.jl: A toolbox for Polynomial
More informationTrust Region Problems with Linear Inequality Constraints: Exact SDP Relaxation, Global Optimality and Robust Optimization
Trust Region Problems with Linear Inequality Constraints: Exact SDP Relaxation, Global Optimality and Robust Optimization V. Jeyakumar and G. Y. Li Revised Version: September 11, 2013 Abstract The trust-region
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 information