Rank-one Generated Spectral Cones Defined by Two Homogeneous Linear Matrix Inequalities
|
|
- Juniper Fowler
- 5 years ago
- Views:
Transcription
1 Rank-one Generated Spectral Cones Defined by Two Homogeneous Linear Matrix Inequalities C.J. Argue Joint work with Fatma Kılınç-Karzan October 22, 2017 INFORMS Annual Meeting Houston, Texas C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 1 / 21 1/21
2 Introduction Motivation Nonconvex quadratic program max x x Qx s.t. x M i x 0, i = 1,..., k C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 2 / 21 2/21
3 Introduction Motivation Nonconvex quadratic program max x x Qx s.t. x M i x 0, i = 1,..., k We have x Ax = Tr(x Ax) = Tr(Axx ) = A, xx. max x Q, xx s.t. M i, xx 0, i = 1,..., k C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 2 / 21 2/21
4 Introduction Motivation Nonconvex quadratic program max x x Qx s.t. x M i x 0, i = 1,..., k We have x Ax = Tr(x Ax) = Tr(Axx ) = A, xx. max x Q, xx s.t. M i, xx 0, i = 1,..., k Can write X = xx if and only if X 0 and rank(x) = 1. max Q, X X s.t. M i, X 0, i = 1,..., k X 0 rank(x) = 1 C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 2 / 21 2/21
5 Introduction Motivation max Q, X X s.t. M i, X 0, i = 1,..., k X 0 rank(x) = 1 The condition rank(x) = 1 is nonconvex. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 3 / 21 3/21
6 Introduction Motivation max Q, X X s.t. M i, X 0, i = 1,..., k X 0 rank(x) = 1 The condition rank(x) = 1 is nonconvex. Convex (semidefinite program) relaxation: max Q, X X s.t. M i, X 0, i = 1,..., k X 0 C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 3 / 21 3/21
7 Introduction Motivation When is this relaxation tight? C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 4 / 21 4/21
8 Introduction Motivation When is this relaxation tight? Feasible set perspective. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 4 / 21 4/21
9 Introduction Motivation When is this relaxation tight? Feasible set perspective. Tight for every objective function if and only if every extreme ray is rank one (Rank-One Generated/ROG). C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 4 / 21 4/21
10 Introduction Motivation When is this relaxation tight? Feasible set perspective. Tight for every objective function if and only if every extreme ray is rank one (Rank-One Generated/ROG). Analogous to integral polyhedra/total unimodularity. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 4 / 21 4/21
11 Introduction Motivation When is this relaxation tight? Feasible set perspective. Tight for every objective function if and only if every extreme ray is rank one (Rank-One Generated/ROG). Analogous to integral polyhedra/total unimodularity. Burer 15, Hildebrand 16, Blekherman et al. 16. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 4 / 21 4/21
12 Introduction Our Question Question Let M 1, M 2 be n n symmetric matrices. When is S := {Y 0 : Y, M 1 0, Y, M 2 0} an ROG cone? C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 5 / 21 5/21
13 Introduction Outline Two geometric perspectives. Each perspective gives a sufficient condition for S to be ROG. Together these conditions are also necessary. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 6 / 21 6/21
14 Introduction Outline Two geometric perspectives. Each perspective gives a sufficient condition for S to be ROG. Together these conditions are also necessary. M, Y = 0 as a hyperplane in S n := {n n symmetric matrices}. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 6 / 21 6/21
15 Introduction Outline Two geometric perspectives. Each perspective gives a sufficient condition for S to be ROG. Together these conditions are also necessary. M, Y = 0 as a hyperplane in S n := {n n symmetric matrices}. M, xx = x M 1 x as a quadratic form in R n. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 6 / 21 6/21
16 Introduction Recap A set/cone is ROG if all its extreme points/rays have rank 1. SDP relaxations of quadratic programs are tight for every objective function if and only if the feasible set is ROG. Consider S := {Y 0 : Y, M 1 0, Y, M 2 0} (two LMIs). Two geometric perspectives S n and R n. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 7 / 21 7/21
17 Geometry of S n + Rank Consider S n + := {positive semidefinite n n matrices} S n. [ ] 1 0 Red ray: 0 0 [ ] 1 0 Green ray: 0 1 Rank 1 extreme. Rank 2 not extreme. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 8 / 21 8/21
18 Geometry of S n + One LMI Fact [Ye, Zhang 03] S := {Y 0 : M, Y 0} is ROG for any M S 3. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 9 / 21 9/21
19 Geometry of S n + Two LMIs Interacting inside S n +. Non-interacting inside S n +. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 10 / 21 10/21
20 Geometry of S n + Non-interacting LMIs If M 1 and M 2 are non-interacting, then every extreme ray of S = {Y 0 : Y, M 1 0, Y, M 2 0} is an extreme ray of either {Y 0 : Y, M 1 0} or {Y 0 : Y, M 2 0}. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 11 / 21 11/21
21 Geometry of S n + Non-interacting LMIs If M 1 and M 2 are non-interacting, then every extreme ray of S = {Y 0 : Y, M 1 0, Y, M 2 0} is an extreme ray of either {Y 0 : Y, M 1 0} or {Y 0 : Y, M 2 0}. S is ROG. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 11 / 21 11/21
22 Geometry of S n + Non-interacting LMIs Non-interacting inside S n + when: One LMI does not intersect S n +, i.e. when ±M i 0. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 12 / 21 12/21
23 Geometry of S n + Non-interacting LMIs Non-interacting inside S n + when: One LMI does not intersect S n +, i.e. when ±M i 0. ±M 1, X 0 is a consequence of ±M 2, X 0 for X 0. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 12 / 21 12/21
24 Geometry of S n + Non-interacting LMIs Non-interacting inside S n + when: One LMI does not intersect S n +, i.e. when ±M i 0. ±M 1, X 0 is a consequence of ±M 2, X 0 for X 0. Using S-lemma, this is true when λ(±m 1 ) (±M 2 ) 0 for some λ 0. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 12 / 21 12/21
25 Geometry of S n + Non-interacting LMIs Non-interacting inside S n + when: One LMI does not intersect S n +, i.e. when ±M i 0. ±M 1, X 0 is a consequence of ±M 2, X 0 for X 0. Using S-lemma, this is true when λ(±m 1 ) (±M 2 ) 0 for some λ 0. In sum, non-interacting when αm 1 + βm 2 0 for some (α, β) (0, 0). C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 12 / 21 12/21
26 Geometry of S n + Recap Non-interacting LMIs yield ROG cones. M 1, M 2 are non-interacting if ±M 2, Y 0 along with Y 0 implies ±M 1, Y 0. Proposition 1 If αm 1 + βm 2 0 has a nontrivial solution, i.e. (α, β) (0, 0) then S is ROG. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 13 / 21 13/21
27 Showing Y / Ext(S) Question In general, how do we show that a cone is ROG? C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 14 / 21 14/21
28 Showing Y / Ext(S) Question In general, how do we show that a cone is ROG? Show that Y / Ext(S) when: rank(y ) 2. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 14 / 21 14/21
29 Showing Y / Ext(S) Question In general, how do we show that a cone is ROG? Show that Y / Ext(S) when: rank(y ) 2. Y, M 1 = Y, M 2 = 0. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 14 / 21 14/21
30 Showing Y / Ext(S) Question In general, how do we show that a cone is ROG? Show that Y / Ext(S) when: rank(y ) 2. Y, M 1 = Y, M 2 = 0. Find x R n such that Y ± xx S. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 14 / 21 14/21
31 Showing Y / Ext(S) Question In general, how do we show that a cone is ROG? Show that Y / Ext(S) when: rank(y ) 2. Y, M 1 = Y, M 2 = 0. Find x R n such that Y ± xx S. For Y xx 0, need x Range(Y ). C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 14 / 21 14/21
32 Showing Y / Ext(S) Question In general, how do we show that a cone is ROG? Show that Y / Ext(S) when: rank(y ) 2. Y, M 1 = Y, M 2 = 0. Find x R n such that Y ± xx S. For Y xx 0, need x Range(Y ). Since Y, M i = 0, need 0 = xx, M i = x M i x. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 14 / 21 14/21
33 Quadratic Forms Zero Sets Fix a candidate extreme ray Y. Define N 1 := {x R n : x M 1 x = 0}. N 2 := {x R n : x M 2 x = 0}. When is Range(Y ) N 1 N 2 {0}? C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 15 / 21 15/21
34 Quadratic Forms Start with n = 3. Consider Y S 3 +, rank(y ) = 2. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 16 / 21 16/21
35 Quadratic Forms Start with n = 3. Consider Y S 3 +, rank(y ) = 2. Range(Y ) is a plane. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 16 / 21 16/21
36 Quadratic Forms Start with n = 3. Consider Y S 3 +, rank(y ) = 2. Range(Y ) is a plane. If N 1 N 2 R 3 contains a plane, then it intersects every plane nontrivially. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 16 / 21 16/21
37 Quadratic Forms Start with n = 3. Consider Y S 3 +, rank(y ) = 2. Range(Y ) is a plane. If N 1 N 2 R 3 contains a plane, then it intersects every plane nontrivially. Observation S is ROG when N 1 N 2 contains a plane. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 16 / 21 16/21
38 Quadratic Forms N 1 N 2 contains a plane Question When does N 1 N 2 contain a plane? C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 17 / 21 17/21
39 Quadratic Forms N 1 N 2 contains a plane Question When does N 1 N 2 contain a plane? {x R 3 : x Mx = 0} contains a plane when rank(m) 2 and M is indefinite. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 17 / 21 17/21
40 Quadratic Forms N 1 N 2 contains a plane Question When does N 1 N 2 contain a plane? {x R 3 : x Mx = 0} contains a plane when rank(m) 2 and M is indefinite. For any (α, β), N α,β := {x R 3 : x (αm 1 + βm 2 )x = 0} N 1 N 2. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 17 / 21 17/21
41 Quadratic Forms N 1 N 2 contains a plane Question When does N 1 N 2 contain a plane? {x R 3 : x Mx = 0} contains a plane when rank(m) 2 and M is indefinite. For any (α, β), N α,β := {x R 3 : x (αm 1 + βm 2 )x = 0} N 1 N 2. In particular, N α,β contains a plane for all (α, β). C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 17 / 21 17/21
42 Quadratic Forms N 1 N 2 contains a plane Question When does N 1 N 2 contain a plane? Answer {x R 3 : x Mx = 0} contains a plane when rank(m) 2 and M is indefinite. For any (α, β), N α,β := {x R 3 : x (αm 1 + βm 2 )x = 0} N 1 N 2. In particular, N α,β contains a plane for all (α, β). When rank(αm 1 + βm 2 ) 2 for all (α, β). C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 17 / 21 17/21
43 Geometry of Quadratic Forms Recap Y is not an extreme ray when Range(Y ) N 1 N 2 has a nonzero element. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 18 / 21 18/21
44 Geometry of Quadratic Forms Recap Y is not an extreme ray when Range(Y ) N 1 N 2 has a nonzero element. In R 3, if N 1 N 2 contains a plane, no rank 2 extreme rays. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 18 / 21 18/21
45 Geometry of Quadratic Forms Recap Y is not an extreme ray when Range(Y ) N 1 N 2 has a nonzero element. In R 3, if N 1 N 2 contains a plane, no rank 2 extreme rays. N 1 N 2 contains a plane when rank(αm 1 + βm 2 ) 2 for all α, β. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 18 / 21 18/21
46 Geometry of Quadratic Forms Recap Y is not an extreme ray when Range(Y ) N 1 N 2 has a nonzero element. In R 3, if N 1 N 2 contains a plane, no rank 2 extreme rays. N 1 N 2 contains a plane when rank(αm 1 + βm 2 ) 2 for all α, β. Proposition 2 S is ROG when rank(αm 1 + βm 2 ) 2 for all (α, β), Span{Range(M 1 ) Range(M 2 )} has dimension 3, and αm 1 + βm 2 0 has only the trivial solution (α, β) = (0, 0). C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 18 / 21 18/21
47 Main Result Theorem 3 (A, Kılınç-Karzan, 17) {Y 0 : M 1, Y 0, M 2, Y 0} is ROG iff one of the following holds (i) αm 1 + βm 2 0 for some (α, β) (0, 0). (ii) rank(αm 1 + βm 2 ) 2 for all (α, β) and Span{Range(M 1 ) Range(M 2 )} has dimension 3. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 19 / 21 19/21
48 Proving Necessity (Sketch) First consider the case of S 3. Suppose that: (i) αm 1 + βm 2 0 for any (α, β) (0, 0). (ii) rank(am 1 + bm 2 ) 3 for some (a, b). C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 20 / 21 20/21
49 Proving Necessity (Sketch) First consider the case of S 3. Suppose that: (i) αm 1 + βm 2 0 for any (α, β) (0, 0). (ii) rank(am 1 + bm 2 ) 3 for some (a, b). Need to construct an extreme ray Y of rank 2. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 20 / 21 20/21
50 Proving Necessity (Sketch) First consider the case of S 3. Suppose that: (i) αm 1 + βm 2 0 for any (α, β) (0, 0). (ii) rank(am 1 + bm 2 ) 3 for some (a, b). Need to construct an extreme ray Y of rank 2. rank(am 1 + bm 2 ) = 3 implies that N 1 N 2 is sparse. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 20 / 21 20/21
51 Proving Necessity (Sketch) First consider the case of S 3. Suppose that: (i) αm 1 + βm 2 0 for any (α, β) (0, 0). (ii) rank(am 1 + bm 2 ) 3 for some (a, b). Need to construct an extreme ray Y of rank 2. rank(am 1 + bm 2 ) = 3 implies that N 1 N 2 is sparse. Get a vector z that is not spanned by any two vectors of N 1 N 2. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 20 / 21 20/21
52 Proving Necessity (Sketch) First consider the case of S 3. Suppose that: (i) αm 1 + βm 2 0 for any (α, β) (0, 0). (ii) rank(am 1 + bm 2 ) 3 for some (a, b). Need to construct an extreme ray Y of rank 2. rank(am 1 + bm 2 ) = 3 implies that N 1 N 2 is sparse. Get a vector z that is not spanned by any two vectors of N 1 N 2. Use infeasibility of αm 1 + βm 2 0 for (α, β) (0, 0) to get w such that Y = zz T + ww T is tight for both LMIs (w λz for λ R). C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 20 / 21 20/21
53 Proving Necessity (Sketch) First consider the case of S 3. Suppose that: (i) αm 1 + βm 2 0 for any (α, β) (0, 0). (ii) rank(am 1 + bm 2 ) 3 for some (a, b). Need to construct an extreme ray Y of rank 2. rank(am 1 + bm 2 ) = 3 implies that N 1 N 2 is sparse. Get a vector z that is not spanned by any two vectors of N 1 N 2. Use infeasibility of αm 1 + βm 2 0 for (α, β) (0, 0) to get w such that Y = zz T + ww T is tight for both LMIs (w λz for λ R). We reduce the general case of S n to the case of S 3. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 20 / 21 20/21
54 Extensions/Questions Necessary and sufficient conditions for more than 2 LMIs. Use results to analyze conic constraints. Alternate analysis of Burer s work on extensions of the Trust Region Subproblem. Necessary and sufficient conditions for more general conic constraints. C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 21 / 21 21/21
55 Thank you! C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 21 / 21 21/21
56 Further Reading Samuel Burer (2015). A Gentle Geometric Introduction to Copositive Optimization. Mathematical Programming, June 2015, Volume 151, Issue 1, pp Roland Hildebrand (2016). Spectrahedral Cones Generated by Rank-1 Matrices Journal of Global Optimization, Feb. 2016, Volume 64, Issue 2, pp Grigoriy Blekherman et al. (2016). Do Sums of Squares Dream of Free Resolutions? SIAM J. Appl. Algebra Geometry, 1(1), C. Argue, F. Kılınç-Karzan (CMU) ROG spectral cones defined by two LMIs 21 / 21 21/21
The Trust Region Subproblem with Non-Intersecting Linear Constraints
The Trust Region Subproblem with Non-Intersecting Linear Constraints Samuel Burer Boshi Yang February 21, 2013 Abstract This paper studies an extended trust region subproblem (etrs in which the trust region
More informationStructure of Valid Inequalities for Mixed Integer Conic Programs
Structure of Valid Inequalities for Mixed Integer Conic Programs Fatma Kılınç-Karzan Tepper School of Business Carnegie Mellon University 18 th Combinatorial Optimization Workshop Aussois, France January
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 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 informationA Gentle, Geometric Introduction to Copositive Optimization
A Gentle, Geometric Introduction to Copositive Optimization Samuel Burer September 25, 2014 Revised: January 17, 2015 Abstract This paper illustrates the fundamental connection between nonconvex quadratic
More informationStructure in Mixed Integer Conic Optimization: From Minimal Inequalities to Conic Disjunctive Cuts
Structure in Mixed Integer Conic Optimization: From Minimal Inequalities to Conic Disjunctive Cuts Fatma Kılınç-Karzan Tepper School of Business Carnegie Mellon University Joint work with Sercan Yıldız
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 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 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 informationDisjunctive Cuts for Cross-Sections of the Second-Order Cone
Disjunctive Cuts for Cross-Sections of the Second-Order Cone Sercan Yıldız Gérard Cornuéjols June 10, 2014 Abstract In this paper we provide a unified treatment of general two-term disjunctions on crosssections
More informationarxiv: v3 [math.oc] 24 May 2016
Mathematical Programming manuscript No. (will be inserted by the editor) How to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic Samuel Burer Fatma Kılınç-Karzan arxiv:1406.1031v3
More informationAn Introduction to Linear Matrix Inequalities. Raktim Bhattacharya Aerospace Engineering, Texas A&M University
An Introduction to Linear Matrix Inequalities Raktim Bhattacharya Aerospace Engineering, Texas A&M University Linear Matrix Inequalities What are they? Inequalities involving matrix variables Matrix variables
More informationProblem 1 (Exercise 2.2, Monograph)
MS&E 314/CME 336 Assignment 2 Conic Linear Programming January 3, 215 Prof. Yinyu Ye 6 Pages ASSIGNMENT 2 SOLUTIONS Problem 1 (Exercise 2.2, Monograph) We prove the part ii) of Theorem 2.1 (Farkas Lemma
More informationHow to convexify the intersection of a second order cone and a nonconvex quadratic
Math. Program., Ser. A (217 162:393 429 DOI 1.17/s117-16-145-z FULL LENGTH PAPER How to convexify the intersection of a second order cone and a nonconvex quadratic Samuel Burer 1 Fatma Kılınç-Karzan 2
More informationHow to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic
How to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic arxiv:1406.1031v2 [math.oc] 5 Jun 2014 Samuel Burer Fatma Kılınç-Karzan June 3, 2014 Abstract A recent series of papers
More informationCopositive Programming and Combinatorial Optimization
Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with M. Bomze (Wien) and F. Jarre (Düsseldorf) and
More informationSecond Order Cone Programming Relaxation of Positive Semidefinite Constraint
Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo
More 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 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 informationTwo-Term Disjunctions on the Second-Order Cone
Noname manuscript No. (will be inserted by the editor) Two-Term Disjunctions on the Second-Order Cone Fatma Kılınç-Karzan Sercan Yıldız the date of receipt and acceptance should be inserted later Abstract
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 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 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 informationA Unified Theorem on SDP Rank Reduction. yyye
SDP Rank Reduction Yinyu Ye, EURO XXII 1 A Unified Theorem on SDP Rank Reduction Yinyu Ye Department of Management Science and Engineering and Institute of Computational and Mathematical Engineering Stanford
More informationConsidering Copositivity Locally
Considering Copositivity Locally Peter J.C. Dickinson Uni. of Groningen Uni. of Vienna Uni. of Twente Roland Hildebrand Uni. of Grenoble Weierstrass Institute Uni. of Grenoble IFORS 2017 Thursday 20th
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 informationThe Difference Between 5 5 Doubly Nonnegative and Completely Positive Matrices
The Difference Between 5 5 Doubly Nonnegative and Completely Positive Matrices Sam Burer and Kurt M. Anstreicher University of Iowa Mirjam Dür TU Darmstadt IMA Hot Topics Workshop, November 2008 Consider
More information3. For a given dataset and linear model, what do you think is true about least squares estimates? Is Ŷ always unique? Yes. Is ˆβ always unique? No.
7. LEAST SQUARES ESTIMATION 1 EXERCISE: Least-Squares Estimation and Uniqueness of Estimates 1. For n real numbers a 1,...,a n, what value of a minimizes the sum of squared distances from a to each of
More informationNonconvex Quadratic Programming: Return of the Boolean Quadric Polytope
Nonconvex Quadratic Programming: Return of the Boolean Quadric Polytope Kurt M. Anstreicher Dept. of Management Sciences University of Iowa Seminar, Chinese University of Hong Kong, October 2009 We consider
More informationRanks of Real Symmetric Tensors
Ranks of Real Symmetric Tensors Greg Blekherman SIAM AG 2013 Algebraic Geometry of Tensor Decompositions Real Symmetric Tensor Decompositions Let f be a form of degree d in R[x 1,..., x n ]. We would like
More informationA 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 informationMatrix Rank-One Decomposition. and Applications
Matrix rank-one decomposition and applications 1 Matrix Rank-One Decomposition and Applications Shuzhong Zhang Department of Systems Engineering and Engineering Management The Chinese University of Hong
More informationCopositive matrices and periodic dynamical systems
Extreme copositive matrices and periodic dynamical systems Weierstrass Institute (WIAS), Berlin Optimization without borders Dedicated to Yuri Nesterovs 60th birthday February 11, 2016 and periodic dynamical
More informationarxiv: v1 [math.oc] 14 Oct 2014
arxiv:110.3571v1 [math.oc] 1 Oct 01 An Improved Analysis of Semidefinite Approximation Bound for Nonconvex Nonhomogeneous Quadratic Optimization with Ellipsoid Constraints Yong Hsia a, Shu Wang a, Zi Xu
More informationOn Conic QPCCs, Conic QCQPs and Completely Positive Programs
Noname manuscript No. (will be inserted by the editor) On Conic QPCCs, Conic QCQPs and Completely Positive Programs Lijie Bai John E.Mitchell Jong-Shi Pang July 28, 2015 Received: date / Accepted: date
More informationNew Rank-One Matrix Decomposition Techniques and Applications to Signal Processing
New Rank-One Matrix Decomposition Techniques and Applications to Signal Processing Yongwei Huang Hong Kong Baptist University SPOC 2012 Hefei China July 1, 2012 Outline Trust-region subproblems in nonlinear
More informationOn the structure of the 5 x 5 copositive cone
On the structure of the 5 x 5 copositive cone Roland Hildebrand 1 Mirjam Dür 2 Peter Dickinson Luuk Gijbens 3 1 Laboratory Jean Kuntzmann, University Grenoble 1 / CNRS 2 Mathematics Dept., University Trier
More informationIE 521 Convex Optimization
Lecture 14: and Applications 11th March 2019 Outline LP SOCP SDP LP SOCP SDP 1 / 21 Conic LP SOCP SDP Primal Conic Program: min c T x s.t. Ax K b (CP) : b T y s.t. A T y = c (CD) y K 0 Theorem. (Strong
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 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 2: The Simplex method. 1. Repetition of the geometrical simplex method. 2. Linear programming problems on standard form.
Lecture 2: The Simplex method. Repetition of the geometrical simplex method. 2. Linear programming problems on standard form. 3. The Simplex algorithm. 4. How to find an initial basic solution. Lecture
More informationOn Sublinear Inequalities for Mixed Integer Conic Programs
Noname manuscript No. (will be inserted by the editor) On Sublinear Inequalities for Mixed Integer Conic Programs Fatma Kılınç-Karzan Daniel E. Steffy Submitted: December 2014; Revised: July 7, 2015 Abstract
More informationOn Sublinear Inequalities for Mixed Integer Conic Programs
Noname manuscript No. (will be inserted by the editor) On Sublinear Inequalities for Mixed Integer Conic Programs Fatma Kılınç-Karzan Daniel E. Steffy Submitted: December 2014; Revised: July 2015 Abstract
More informationMulti-stage convex relaxation approach for low-rank structured PSD matrix recovery
Multi-stage convex relaxation approach for low-rank structured PSD matrix recovery Department of Mathematics & Risk Management Institute National University of Singapore (Based on a joint work with Shujun
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 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 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 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 informationModeling with semidefinite and copositive matrices
Modeling with semidefinite and copositive matrices Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria F. Rendl, Singapore workshop 2006 p.1/24 Overview Node and Edge relaxations
More informationFast and Robust Phase Retrieval
Fast and Robust Phase Retrieval Aditya Viswanathan aditya@math.msu.edu CCAM Lunch Seminar Purdue University April 18 2014 0 / 27 Joint work with Yang Wang Mark Iwen Research supported in part by National
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 informationJordan-algebraic aspects of optimization:randomization
Jordan-algebraic aspects of optimization:randomization L. Faybusovich, Department of Mathematics, University of Notre Dame, 255 Hurley Hall, Notre Dame, IN, 46545 June 29 2007 Abstract We describe a version
More informationA solution approach for linear optimization with completely positive matrices
A solution approach for linear optimization with completely positive matrices Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with M. Bomze (Wien) and F.
More informationHMH Fuse Algebra correlated to the. Texas Essential Knowledge and Skills for Mathematics High School Algebra 2
HMH Fuse Algebra 2 2012 correlated to the Texas Essential Knowledge and Skills for Mathematics High School Algebra 2 111.33. Algebra II (b) Knowledge and skills. (1) Foundations for functions. The student
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 informationExample: feasibility. Interpretation as formal proof. Example: linear inequalities and Farkas lemma
4-1 Algebra and Duality P. Parrilo and S. Lall 2006.06.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone of valid
More informationA Geometrical Analysis of a Class of Nonconvex Conic Programs for Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems
A Geometrical Analysis of a Class of Nonconvex Conic Programs for Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh arxiv:1901.02179v1
More informationQuadratic Optimization over a Second-Order Cone with Linear Equality Constraints
JORC (2014) 2:17 38 DOI 10.1007/s40305-013-0035-6 Quadratic Optimization over a Second-Order Cone with Linear Equality Constraints Xiao-ling Guo Zhi-bin Deng Shu-Cherng Fang Zhen-bo Wang Wen-xun Xing Received:
More information' Liberty and Umou Ono and Inseparablo "
3 5? #< q 8 2 / / ) 9 ) 2 ) > < _ / ] > ) 2 ) ) 5 > x > [ < > < ) > _ ] ]? <
More informationApproximate Farkas Lemmas in Convex Optimization
Approximate Farkas Lemmas in Convex Optimization Imre McMaster University Advanced Optimization Lab AdvOL Graduate Student Seminar October 25, 2004 1 Exact Farkas Lemma Motivation 2 3 Future plans The
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 informationMcMaster University. Advanced Optimization Laboratory. Title: A survey of the S-lemma. Authors: Imre Pólik, Tamás Terlaky. AdvOL-Report No.
McMaster University Advanced Optimization Laboratory Title: A survey of the S-lemma Authors: Imre Pólik, Tamás Terlaky AdvOL-Report No. 2004/14 September 2004 July 2005 February 2006 July 2006 Hamilton,
More informationLow-Complexity Relaxations and Convex Hulls of Disjunctions on the Positive Semidefinite Cone and General Regular Cones
Low-Complexity Relaxations and Convex Hulls of Disjunctions on the Positive Semidefinite Cone and General Regular Cones Sercan Yıldız and Fatma Kılınç-Karzan Tepper School of Business, Carnegie Mellon
More informationOn minimizing a quadratic function on Stiefel manifold
Linear Algebra and its Applications 475 (2015) 251 264 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa On minimizing a quadratic function on Stiefel
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 informationRank minimization via the γ 2 norm
Rank minimization via the γ 2 norm Troy Lee Columbia University Adi Shraibman Weizmann Institute Rank Minimization Problem Consider the following problem min X rank(x) A i, X b i for i = 1,..., k Arises
More information1 Strict local optimality in unconstrained optimization
ORF 53 Lecture 14 Spring 016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Thursday, April 14, 016 When in doubt on the accuracy of these notes, please cross check with the instructor s
More informationLagrangian-Conic Relaxations, Part I: A Unified Framework and Its Applications to Quadratic Optimization Problems
Lagrangian-Conic Relaxations, Part I: A Unified Framework and Its Applications to Quadratic Optimization Problems Naohiko Arima, Sunyoung Kim, Masakazu Kojima, and Kim-Chuan Toh Abstract. In Part I of
More informationCopositive Programming and Combinatorial Optimization
Copositive Programming and Combinatorial Optimization Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria joint work with I.M. Bomze (Wien) and F. Jarre (Düsseldorf) IMA
More informationRepresentations of Positive Polynomials: Theory, Practice, and
Representations of Positive Polynomials: Theory, Practice, and Applications Dept. of Mathematics and Computer Science Emory University, Atlanta, GA Currently: National Science Foundation Temple University
More informationPolynomial Solvability of Variants of the Trust-Region Subproblem
Polynomial Solvability of Variants of the Trust-Region Subproblem Daniel Bienstock Alexander Michalka July, 2013 Abstract We consider an optimization problem of the form x T Qx + c T x s.t. x µ h r h,
More informationOptimizing Convex Functions over Non-Convex Domains
Optimizing Convex Functions over Non-Convex Domains Daniel Bienstock and Alexander Michalka University Berlin 2012 Introduction Generic Problem: min Q(x), s.t. x F, Introduction Generic Problem: min Q(x),
More informationarxiv:math/ v1 [math.co] 23 May 2000
Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems arxiv:math/0005229v1 [math.co] 23 May 2000 Masakazu Kojima Department of Mathematical and Computing Sciences
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 431 (2009) 1539 1552 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa The difference between
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 information3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions
A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence
More informationGame theory: Models, Algorithms and Applications Lecture 4 Part II Geometry of the LCP. September 10, 2008
Game theory: Models, Algorithms and Applications Lecture 4 Part II Geometry of the LCP September 10, 2008 Geometry of the Complementarity Problem Definition 1 The set pos(a) generated by A R m p represents
More informationWe describe the generalization of Hazan s algorithm for symmetric programming
ON HAZAN S ALGORITHM FOR SYMMETRIC PROGRAMMING PROBLEMS L. FAYBUSOVICH Abstract. problems We describe the generalization of Hazan s algorithm for symmetric programming Key words. Symmetric programming,
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 informationHandout 6: Some Applications of Conic Linear Programming
ENGG 550: Foundations of Optimization 08 9 First Term Handout 6: Some Applications of Conic Linear Programming Instructor: Anthony Man Cho So November, 08 Introduction Conic linear programming CLP, and
More informationA sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
Volume 31, N. 1, pp. 205 218, 2012 Copyright 2012 SBMAC ISSN 0101-8205 / ISSN 1807-0302 (Online) www.scielo.br/cam A sensitivity result for quadratic semidefinite programs with an application to a sequential
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 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 informationAbsolute value equations
Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West
More informationc 2000 Society for Industrial and Applied Mathematics
SIAM J. OPIM. Vol. 10, No. 3, pp. 750 778 c 2000 Society for Industrial and Applied Mathematics CONES OF MARICES AND SUCCESSIVE CONVEX RELAXAIONS OF NONCONVEX SES MASAKAZU KOJIMA AND LEVEN UNÇEL Abstract.
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 informationPreliminaries Overview OPF and Extensions. Convex Optimization. Lecture 8 - Applications in Smart Grids. Instructor: Yuanzhang Xiao
Convex Optimization Lecture 8 - Applications in Smart Grids Instructor: Yuanzhang Xiao University of Hawaii at Manoa Fall 2017 1 / 32 Today s Lecture 1 Generalized Inequalities and Semidefinite Programming
More informationAlgebra II (One-Half to One Credit).
111.33. Algebra II (One-Half to One Credit). T 111.33. Algebra II (One-Half to One Credit). (a) Basic understandings. (1) Foundation concepts for high school mathematics. As presented in Grades K-8, the
More informationOnline generation via offline selection - Low dimensional linear cuts from QP SDP relaxation -
Online generation via offline selection - Low dimensional linear cuts from QP SDP relaxation - Radu Baltean-Lugojan Ruth Misener Computational Optimisation Group Department of Computing Pierre Bonami Andrea
More informationThe Pythagoras numbers of projective varieties.
The Pythagoras numbers of projective varieties. Grigoriy Blekherman (Georgia Tech, USA) Rainer Sinn (FU Berlin, Germany) Gregory G. Smith (Queen s University, Canada) Mauricio Velasco (Universidad de los
More informationComplexity of Deciding Convexity in Polynomial Optimization
Complexity of Deciding Convexity in Polynomial Optimization Amir Ali Ahmadi Joint work with: Alex Olshevsky, Pablo A. Parrilo, and John N. Tsitsiklis Laboratory for Information and Decision Systems Massachusetts
More 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 informationSolution-recovery in l 1 -norm for non-square linear systems: deterministic conditions and open questions
Solution-recovery in l 1 -norm for non-square linear systems: deterministic conditions and open questions Yin Zhang Technical Report TR05-06 Department of Computational and Applied Mathematics Rice University,
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 informationSemidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization
Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Instructor: Farid Alizadeh Author: Ai Kagawa 12/12/2012
More informationQuadratic reformulation techniques for 0-1 quadratic programs
OSE SEMINAR 2014 Quadratic reformulation techniques for 0-1 quadratic programs Ray Pörn CENTER OF EXCELLENCE IN OPTIMIZATION AND SYSTEMS ENGINEERING ÅBO AKADEMI UNIVERSITY ÅBO NOVEMBER 14th 2014 2 Structure
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 informationModule 04 Optimization Problems KKT Conditions & Solvers
Module 04 Optimization Problems KKT Conditions & Solvers Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html September
More informationInteger Quadratic Programming is in NP
Alberto Del Pia 1 Santanu S. Dey 2 Marco Molinaro 2 1 IBM T. J. Watson Research Center, Yorktown Heights. 2 School of Industrial and Systems Engineering, Atlanta Outline 1 4 Program: Definition Definition
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 information