Towards Solving Bilevel Optimization Problems in Quantum Information Theory
|
|
- Isaac Maxwell
- 5 years ago
- Views:
Transcription
1 Towards Solving Bilevel Optimization Problems in Quantum Information Theory ICFO-The Institute of Photonic Sciences and University of Borås 22 January 2016 Workshop on Linear Matrix Inequalities, Semidefinite Programming and Quantum Information Theory
2 Outline 1 The Bilevel Problem 2 Polynomial Optimization Problems of Commuting Variables 3 Parametric Polynomial Optimization Problems of Commuting Variables 4 Polynomial Optimization Problems of Noncommuting Variables 5 Summary
3 The Generic Form min f (x, y) x R n,y Rm such that g i (x, y) 0, i = 1,..., s This is the upper level problem.
4 The Generic Form min f (x, y) x R n,y Rm such that g i (x, y) 0, i = 1,..., s This is the upper level problem. The lower level problem is: y Y (x) = argmin w R m{g(x, w) : h j (w) 0, j = 1,..., r}.
5 The Generic Form min f (x, y) x R n,y Rm such that g i (x, y) 0, i = 1,..., s This is the upper level problem. The lower level problem is: or: y Y (x) = argmin w R m{g(x, w) : h j (w) 0, j = 1,..., r}. y Y (x) = argmin w R m{g(x, w) : h j (x, w) 0, j = 1,..., r}.
6 Min-Max Problems Also known as pursuit-evasion games min f (x, y) x R n,y Rm such that g i (x, y) 0, i = 1,..., s, y Y (x) = argmax w R m{f (x, w) : h j (w) 0, j = 1,..., r}.
7 Outline 1 The Bilevel Problem 2 Polynomial Optimization Problems of Commuting Variables 3 Parametric Polynomial Optimization Problems of Commuting Variables 4 Polynomial Optimization Problems of Noncommuting Variables 5 Summary
8 The Two Types of Bilevel POPs 1 Convex lower level objective function.
9 The Two Types of Bilevel POPs 1 Convex lower level objective function. Solution: single-level relaxation with Lagrange multipliers. 2 Nonconvex lower level objective funtion.
10 The Two Types of Bilevel POPs 1 Convex lower level objective function. Solution: single-level relaxation with Lagrange multipliers. 2 Nonconvex lower level objective funtion. Solution: iterative approximate solution through parametric POPs and relaxations. V. Jeyakumar, J.B. Lasserre, G. Li, T.S. Pham. Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems. arxiv: J.B. Lasserre. A joint+marginal approach to parametric polynomial optimization. arxiv:
11 Convex Lower Level Objective Nondegeneracy y {h j (w) 0, j = 1,..., r}, h j (y) = 0 h j (y) 0
12 Convex Lower Level Objective Nondegeneracy y {h j (w) 0, j = 1,..., r}, h j (y) = 0 h j (y) 0 + Slater condition
13 Convex Lower Level Objective Nondegeneracy y {h j (w) 0, j = 1,..., r}, h j (y) = 0 h j (y) 0 + Slater condition: Equivalent single-level problem. min f (x, y) x R n,y Rm such that g i (x, y) 0, i = 1,..., s,
14 Convex Lower Level Objective Nondegeneracy y {h j (w) 0, j = 1,..., r}, h j (y) = 0 h j (y) 0 + Slater condition: Equivalent single-level problem. min f (x, y) x R n,y Rm such that g i (x, y) 0, i = 1,..., s, h j (y) 0, i = 1,..., r,
15 Convex Lower Level Objective Nondegeneracy y {h j (w) 0, j = 1,..., r}, h j (y) = 0 h j (y) 0 + Slater condition: Equivalent single-level problem. min f (x, y) x R n,y Rm such that g i (x, y) 0, i = 1,..., s, h j (y) 0, i = 1,..., r, λ 0 y G(x, y) + r j=1 λ r h j (y) = 0,
16 Convex Lower Level Objective Nondegeneracy y {h j (w) 0, j = 1,..., r}, h j (y) = 0 h j (y) 0 + Slater condition: Equivalent single-level problem. min f (x, y) x R n,y Rm such that g i (x, y) 0, i = 1,..., s, h j (y) 0, i = 1,..., r, λ 0 y G(x, y) + r j=1 λ r h j (y) = 0, r j=0 λ2 j = 1, λ j 0, j = 0,..., r, λ j h j (y) = 0, j = 1,..., r.
17 Solving the Equivalent Problem Use the usual hierarchy of relaxation. Convergence. Price to pay:
18 Solving the Equivalent Problem Use the usual hierarchy of relaxation. Convergence. Price to pay: m + 2r + 2 more constraints.
19 Solving the Equivalent Problem Use the usual hierarchy of relaxation. Convergence. Price to pay: m + 2r + 2 more constraints. r + 1 Lagrange multipliers
20 A Case Study: Simulating POVMs Qubit space with a 4-outcome POVM M = {M 1, M 2, M 3, M 4 }, where M i 0, 4 i=1 M i = I. Depolarizing noise: (1 t)m i + ttr(m i ) I, t [0, 1], i = 1,..., 4. 2 A POVM is simulable by a projective measurement if and only int M = α p α M α, where M α are projective measurements, p α 0, and α p α = 1.
21 With a Fixed POVM With the tetrahedron POVM, it is an SDP: min t t [0,1] such that (1 t)m 1 + ttr(m 1 ) I 2 = N N N+ 14, (1 t)m 2 + ttr(m 2 ) I 2 = N 12 + N N+ 24, (1 t)m 3 + ttr(m 4 ) I 2 = N 13 + N 23 + N+ 34, (1 t)m 4 + ttr(m 4 ) I 2 = N 14 + N 24 + N 34, N + ij + N ij = p ij I, N ± ij 0, ij p ij = 1, p ij 0.
22 Which POVM is the Most Robust to Noise? We also optimize over POVMs: min t t [0,1] such that M i 0, 4 i=1 M i = I M = argmax{t (1 t)m 1 + ttr(m 1 ) I 2 = N N N+ 14, (1 t)m 2 + ttr(m 2 ) I 2 = N 12 + N N+ 24, (1 t)m 3 + ttr(m 4 ) I 2 = N 13 + N 23 + N+ 34, (1 t)m 4 + ttr(m 4 ) I 2 = N 14 + N 24 + N 34, N + ij + N ij = p ij I, N ± ij 0, ij p ij = 1, p ij 0.}
23 Quadratic Bilevel POP Parametrize the POVM, and it will become a min-max bilevel quadratic POP of commuting variables with convex lower level objective function. min f (x) x R n,y R m such that g i (x, y) 0, i = 1,..., s, y Y (x) = argmin w R m{f (x) : h j (x, w) 0, j = 1,..., r}.
24 Quadratic Bilevel POP Parametrize the POVM, and it will become a min-max bilevel quadratic POP of commuting variables with convex lower level objective function. min f (x) x R n,y R m such that g i (x, y) 0, i = 1,..., s, y Y (x) = argmin w R m{f (x) : h j (x, w) 0, j = 1,..., r}. The problem: Lower level has 55 (31) variables alone. Bilevel has about 70, without Langrange multipliers. There is no sparsity structure. Actual solution is ad hoc, via discretization.
25 Outline 1 The Bilevel Problem 2 Polynomial Optimization Problems of Commuting Variables 3 Parametric Polynomial Optimization Problems of Commuting Variables 4 Polynomial Optimization Problems of Noncommuting Variables 5 Summary
26 The Parametric Problem J(x) = inf y R m{f (x, y) : h j(y) 0, j = 1,..., r} where x X = {x R n : h k (x) 0, k = r + 1,..., t} J.B. Lasserre. A joint+marginal approach to parametric polynomial optimization. arxiv:
27 Approximate J(x) Primal Form Let γ β = X x β dϕ(x), where ϕ is a Borel probability measure on X with a positive density with respect to the Lebesgue measure on R n.
28 Approximate J(x) Primal Form Let γ β = X x β dϕ(x), where ϕ is a Borel probability measure on X with a positive density with respect to the Lebesgue measure on R n.the primal form reads as inf z L z (f ) such that M k (z) 0, M k vj (h j z) 0, j = 1,..., t, L z (x β ) = γ β, β N n k. Positivity constraints fulfilled finite Borel representing measure µ on K = {h j (y) 0, j = 1,..., r} such that z αβ = K x α y β dµ.
29 Approximate J(x) Dual Form sup p,σi such that X pdϕ f p = σ 0 + t σ j h j j=1 p R[x], σ j Σ[x, y], j = 0,..., t degp 2k,degσ 0 2k, degσ j h j 2k, j = 1,..., t. The polynomial p = 2k β=0 λ βx β is the approximation J k (x).
30 Example X = [0, 1] K = {(x, y) : xy y 2 2 x = 0, y xy 2 2 x = 0} f (x, y) = (1 2x)(y 1 + y 2 ). Analytical solution: J(x)= 2 1 2x x/(1 + x).
31 Bilevel Problem of Nonconvex Lower Level We consider the ɛ-approximation of this case: min f (x, y) x R n,y Rm such that g i (x, y) 0, i = 1,..., s, h j (y) 0, j = 1,..., r, G(x, y) min w R m{g(x, w) : h j (w) 0, j = 1,..., r} ɛ. As ɛ 0, the approximation gives an increasing lower bound (arxiv: ).
32 Enter a Parametric POP min w R m{g(x, w) : h j (w) 0, j = 1,..., r} is a parametric POP.
33 Enter a Parametric POP min w R m{g(x, w) : h j (w) 0, j = 1,..., r} is a parametric POP. Find J(x), but ensure that the parameter set is compact: add a set of constraints on the coordinates of x: {M 2 x 2 l 0, l = 1,..., n} for some M > 0.
34 Iterative Algorithm to Solve Bilevel Problem of Nonconvex Lower Level 1 Fix level k of a relaxation and ɛ.
35 Iterative Algorithm to Solve Bilevel Problem of Nonconvex Lower Level 1 Fix level k of a relaxation and ɛ. 2 Find J k (x).
36 Iterative Algorithm to Solve Bilevel Problem of Nonconvex Lower Level 1 Fix level k of a relaxation and ɛ. 2 Find J k (x). 3 Is the semialgrebraic set {(x, y) g i (x, y) 0, i = 1,..., s, h j (y) 0, j = 1,..., r, G(x, y) J k (x) ɛ} non-empty?
37 Iterative Algorithm to Solve Bilevel Problem of Nonconvex Lower Level 1 Fix level k of a relaxation and ɛ. 2 Find J k (x). 3 Is the semialgrebraic set {(x, y) g i (x, y) 0, i = 1,..., s, h j (y) 0, j = 1,..., r, G(x, y) J k (x) ɛ} non-empty? 4 Solve polynomial optimization problem: min f (x, y) x R n,y Rm such that g i (x, y) 0, i = 1,..., s, h j (y) 0, j = 1,..., r, G(x, y) J k (x) ɛ.
38 Outline 1 The Bilevel Problem 2 Polynomial Optimization Problems of Commuting Variables 3 Parametric Polynomial Optimization Problems of Commuting Variables 4 Polynomial Optimization Problems of Noncommuting Variables 5 Summary
39 Polynomial Optimization Problems of Noncommuting Variables The generic form is: inf φ, p(x)φ X B(H),φ H such that φ = 1, g i (X) 0, i = 1,..., r, φ q j (X) φ 0, j = 1,..., l.
40 Polynomial Optimization Problems of Noncommuting Variables The generic form is: inf Tr(p(X)ρ) such that Tr(ρ) = 1, ρ 0, g i (X) 0, i = 1,..., r, Tr(q j (X)ρ) 0, j = 1,..., l.
41 Polynomial Optimization Problems of Noncommuting Variables The generic form is: inf Tr(p(X)ρ) such that Tr(ρ) = 1, ρ 0, g i (X) 0, i = 1,..., r, Tr(q j (X)ρ) 0, j = 1,..., l. What is the measure here?
42 The Relaxation We replace the optimization problem by the following SDP: min p w y w y such that w M(y) 0, M(g i y) 0, i = 1,..., r. q j,w y w 0, j = 1,..., l. w 2k Pironio, S.; Navascués, M. & Acín, A. Convergent relaxations of polynomial optimization problems with noncommuting variables. SIAM Journal on Optimization, SIAM, 2010, 20, arxiv:
43 Finding the Optimal Measurement for a Noisy State max P αβ s.t. αβ P αβ (αβ xy) αβ P αβ (ab xy) = P(ab xy) P αβ is quantum a, b, x, y α, β Here P(ab xy) are observed values for a fixed noisy state and fixed measurement. O. Nieto-Silleras, S. Pironio, J. Silman. Using complete measurement statistics for optimal device-independent randomness evaluation. New J. Phys. 16, (2014). arxiv:
44 New Bell Inequalities The dual solution provides us with Bell coefficients f abxy. Using these, we would like to obtain an updated set of measurements M that minimize the Bell inequality: min M f abxy P(ab xy) abxy s.t. M A, M B are POVMs
45 Solving the Problem As POP of noncommuting variables?
46 Solving the Problem As POP of noncommuting variables? Parametrizing the measurements?
47 Solving the Problem As POP of noncommuting variables? Parametrizing the measurements? Seesaw.
48 Ground State Energy Problems H free = <rs> [ ] c r c s + c sc r γ(c r c s + c s c r ) 2λ r c r c r The fermionic operators are subject to the following constraints: {c r, c s} = δ rs I r, {c r, c s} = 0, {c r, c s } = 0.
49 Ground State Energy Problems H free = <rs> [ ] c r c s + c sc r γ(c r c s + c s c r ) 2λ r c r c r The fermionic operators are subject to the following constraints: {c r, c s} = δ rs I r, {c r, c s} = 0, {c r, c s } = 0. Level-2 relaxation with physics constraints: 2-RDM.
50 Ground State Energy Problems H free = <rs> [ ] c r c s + c sc r γ(c r c s + c s c r ) 2λ r c r c r The fermionic operators are subject to the following constraints: {c r, c s} = δ rs I r, {c r, c s} = 0, {c r, c s } = 0. Level-2 relaxation with physics constraints: 2-RDM. Correlation length: structural sparsity.
51 Bilevel Formulation to Improve Quality Pauli operators: expensive in the NPA.
52 Bilevel Formulation to Improve Quality Pauli operators: expensive in the NPA. Jordan-Wigner transformation: establish connection between ladder operators and Pauli operators. E.g., the Ising model on a chain in either formulation.
53 Bilevel Formulation to Improve Quality Pauli operators: expensive in the NPA. Jordan-Wigner transformation: establish connection between ladder operators and Pauli operators. E.g., the Ising model on a chain in either formulation. Impose a lower-level problem in the Pauli operators, establish relationship via moments.
54 Outline 1 The Bilevel Problem 2 Polynomial Optimization Problems of Commuting Variables 3 Parametric Polynomial Optimization Problems of Commuting Variables 4 Polynomial Optimization Problems of Noncommuting Variables 5 Summary
55 The Problem of Generating SDPs Ncpol2sdpa: symbolic description of (non)commutative polynomial optimization problem to a numerical SDP relaxation. Sparsest possible SDPs. SDPA: Parallel and distributed SDP solver. Arbitrary-precision variant. Wittek, P.: Algorithm 950: Ncpol2sdpa Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables. ACM Transactions on Mathematical Software, 2015, 41(3):21. arxiv:
56 Summary Bilevel optimization has many applications in quantum information theory. Bilevel SDPs would be great. POPs of commuting variables did not fare well thus far. Theory is for bilevel POPs of noncommuting variables is lagging behind.
Global 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 informationMoments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations
Moments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations LAAS-CNRS and Institute of Mathematics, Toulouse, France Tutorial, IMS, Singapore 2012 LP-relaxations LP- VERSUS SDP-relaxations
More informationMoments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations
Moments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations LAAS-CNRS and Institute of Mathematics, Toulouse, France EECI Course: February 2016 LP-relaxations LP- VERSUS SDP-relaxations
More informationNon-commutative polynomial optimization
Non-commutative polynomial optimization S. Pironio 1, M. Navascuès 2, A. Acín 3 1 Laboratoire d Information Quantique (Brussels) 2 Department of Mathematics (Bristol) 3 ICFO-The Institute of Photonic Sciences
More informationThe moment-lp and moment-sos approaches in optimization
The moment-lp and moment-sos approaches in optimization LAAS-CNRS and Institute of Mathematics, Toulouse, France Workshop Linear Matrix Inequalities, Semidefinite Programming and Quantum Information Theory
More informationThe moment-lp and moment-sos approaches
The moment-lp and moment-sos approaches LAAS-CNRS and Institute of Mathematics, Toulouse, France CIRM, November 2013 Semidefinite Programming Why polynomial optimization? LP- and SDP- CERTIFICATES of POSITIVITY
More informationConvex Optimization & Parsimony of L p-balls representation
Convex Optimization & Parsimony of L p -balls representation LAAS-CNRS and Institute of Mathematics, Toulouse, France IMA, January 2016 Motivation Unit balls associated with nonnegative homogeneous polynomials
More informationarxiv: v2 [math.oc] 31 May 2010
A joint+marginal algorithm for polynomial optimization Jean B. Lasserre and Tung Phan Thanh arxiv:1003.4915v2 [math.oc] 31 May 2010 Abstract We present a new algorithm for solving a polynomial program
More informationStrong duality in Lasserre s hierarchy for polynomial optimization
Strong duality in Lasserre s hierarchy for polynomial optimization arxiv:1405.7334v1 [math.oc] 28 May 2014 Cédric Josz 1,2, Didier Henrion 3,4,5 Draft of January 24, 2018 Abstract A polynomial optimization
More informationLinear Matrix Inequalities, Semidefinite Programming and Quantum Information Theory
Linear Matrix Inequalities, Semidefinite Programming and Quantum Information Theory Toulouse, 18-22 January 2015 1. Antonio Acín (ICFO-The Institute of Photonic Sciences, Barcelona) Non-commutative polynomial
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 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 informationA new look at nonnegativity on closed sets
A new look at nonnegativity on closed sets LAAS-CNRS and Institute of Mathematics, Toulouse, France IPAM, UCLA September 2010 Positivstellensatze for semi-algebraic sets K R n from the knowledge of defining
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 informationSemialgebraic Relaxations using Moment-SOS Hierarchies
Semialgebraic Relaxations using Moment-SOS Hierarchies Victor Magron, Postdoc LAAS-CNRS 17 September 2014 SIERRA Seminar Laboratoire d Informatique de l Ecole Normale Superieure y b sin( par + b) b 1 1
More 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 informationOn Polynomial Optimization over Non-compact Semi-algebraic Sets
On Polynomial Optimization over Non-compact Semi-algebraic Sets V. Jeyakumar, J.B. Lasserre and G. Li Revised Version: April 3, 2014 Communicated by Lionel Thibault Abstract The optimal value of a polynomial
More informationOn the local stability of semidefinite relaxations
On the local stability of semidefinite relaxations Diego Cifuentes Department of Mathematics Massachusetts Institute of Technology Joint work with Sameer Agarwal (Google), Pablo Parrilo (MIT), Rekha Thomas
More informationFormal Proofs, Program Analysis and Moment-SOS Relaxations
Formal Proofs, Program Analysis and Moment-SOS Relaxations Victor Magron, Postdoc LAAS-CNRS 15 July 2014 Imperial College Department of Electrical and Electronic Eng. y b sin( par + b) b 1 1 b1 b2 par
More informationA Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials
A Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials G. Y. Li Communicated by Harold P. Benson Abstract The minimax theorem for a convex-concave bifunction is a fundamental theorem
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 informationarxiv: v1 [quant-ph] 30 Nov 2018
Experimentally feasible semi-device-independent certification of 4 outcome POVMs arxiv:8.2872v [quant-ph 30 Nov 208 Piotr Mironowicz, 2, and Marcin Pawłowski 2, 3 Department of Algorithms and System Modeling,
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 notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations
A notion of for Convex, Semidefinite and Extended Formulations Marcel de Carli Silva Levent Tunçel April 26, 2018 A vector in R n is integral if each of its components is an integer, A vector in R n is
More informationShiqian Ma, MAT-258A: Numerical Optimization 1. Chapter 9. Alternating Direction Method of Multipliers
Shiqian Ma, MAT-258A: Numerical Optimization 1 Chapter 9 Alternating Direction Method of Multipliers Shiqian Ma, MAT-258A: Numerical Optimization 2 Separable convex optimization a special case is min f(x)
More informationMultiobjective Mixed-Integer Stackelberg Games
Solving the Multiobjective Mixed-Integer SCOTT DENEGRE TED RALPHS ISE Department COR@L Lab Lehigh University tkralphs@lehigh.edu EURO XXI, Reykjavic, Iceland July 3, 2006 Outline Solving the 1 General
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 informationA JOINT+MARGINAL APPROACH TO PARAMETRIC POLYNOMIAL OPTIMIZATION
A JOINT+MARGINAL APPROACH TO PARAMETRIC POLNOMIAL OPTIMIZATION JEAN B. LASSERRE Abstract. Given a compact parameter set R p, we consider polynomial optimization problems (P y) on R n whose description
More informationDuality. Geoff Gordon & Ryan Tibshirani Optimization /
Duality Geoff Gordon & Ryan Tibshirani Optimization 10-725 / 36-725 1 Duality in linear programs Suppose we want to find lower bound on the optimal value in our convex problem, B min x C f(x) E.g., consider
More informationthat a broad class of conic convex polynomial optimization problems, called
JOTA manuscript No. (will be inserted by the editor) Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone-Programs Vaithilingam Jeyakumar Guoyin Li Communicated by Levent Tunçel Abstract
More informationNew applications of moment-sos hierarchies
New applications of moment-sos hierarchies Victor Magron, Postdoc LAAS-CNRS 13 August 2014 専攻談話会 ( セミナー ) Tokyo Institute of Technology Dept. of Math. & Comput. Sci. y b sin( par + b) b 1 1 b1 b2 par +
More 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 informationLagrange duality. The Lagrangian. We consider an optimization program of the form
Lagrange duality Another way to arrive at the KKT conditions, and one which gives us some insight on solving constrained optimization problems, is through the Lagrange dual. The dual is a maximization
More informationLecture 3: Semidefinite Programming
Lecture 3: Semidefinite Programming Lecture Outline Part I: Semidefinite programming, examples, canonical form, and duality Part II: Strong Duality Failure Examples Part III: Conditions for strong duality
More informationCertified Roundoff Error Bounds using Semidefinite Programming
Certified Roundoff Error Bounds using Semidefinite Programming Victor Magron, CNRS VERIMAG joint work with G. Constantinides and A. Donaldson INRIA Mescal Team Seminar 19 November 2015 Victor Magron Certified
More informationApproximate Optimal Designs for Multivariate Polynomial Regression
Approximate Optimal Designs for Multivariate Polynomial Regression Fabrice Gamboa Collaboration with: Yohan de Castro, Didier Henrion, Roxana Hess, Jean-Bernard Lasserre Universität Potsdam 16th of February
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 informationFakultät für Mathematik und Informatik
Fakultät für Mathematik und Informatik Preprint 2017-03 S. Dempe, F. Mefo Kue Discrete bilevel and semidefinite programg problems ISSN 1433-9307 S. Dempe, F. Mefo Kue Discrete bilevel and semidefinite
More informationHilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry
Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry Rekha R. Thomas University of Washington, Seattle References Monique Laurent, Sums of squares, moment matrices and optimization
More informationGlobal polynomial optimization with Moments Matrices and Border Basis
Global polynomial optimization with Moments Matrices and Border Basis Marta Abril Bucero, Bernard Mourrain, Philippe Trebuchet Inria Méditerranée, Galaad team Juillet 15-19, 2013 M. Abril-Bucero, B. Mourrain,
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 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 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 informationApproximating Pareto Curves using Semidefinite Relaxations
Approximating Pareto Curves using Semidefinite Relaxations Victor Magron, Didier Henrion,,3 Jean-Bernard Lasserre, arxiv:44.477v [math.oc] 6 Jun 4 June 7, 4 Abstract We consider the problem of constructing
More informationPrimal-dual Subgradient Method for Convex Problems with Functional Constraints
Primal-dual Subgradient Method for Convex Problems with Functional Constraints Yurii Nesterov, CORE/INMA (UCL) Workshop on embedded optimization EMBOPT2014 September 9, 2014 (Lucca) Yu. Nesterov Primal-dual
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 informationLagrange Relaxation and Duality
Lagrange Relaxation and Duality As we have already known, constrained optimization problems are harder to solve than unconstrained problems. By relaxation we can solve a more difficult problem by a simpler
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-2804 Research Reports on Mathematical and Computing Sciences Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity Hayato Waki,
More informationConvexification of Mixed-Integer Quadratically Constrained Quadratic Programs
Convexification of Mixed-Integer Quadratically Constrained Quadratic Programs Laura Galli 1 Adam N. Letchford 2 Lancaster, April 2011 1 DEIS, University of Bologna, Italy 2 Department of Management Science,
More informationDuality. Lagrange dual problem weak and strong duality optimality conditions perturbation and sensitivity analysis generalized inequalities
Duality Lagrange dual problem weak and strong duality optimality conditions perturbation and sensitivity analysis generalized inequalities Lagrangian Consider the optimization problem in standard form
More informationAn explicit construction of distinguished representations of polynomials nonnegative over finite sets
An explicit construction of distinguished representations of polynomials nonnegative over finite sets Pablo A. Parrilo Automatic Control Laboratory Swiss Federal Institute of Technology Physikstrasse 3
More informationDevice-Independent Quantum Information Processing (DIQIP)
Device-Independent Quantum Information Processing (DIQIP) Maciej Demianowicz ICFO-Institut de Ciencies Fotoniques, Barcelona (Spain) Coordinator of the project: Antonio Acín (ICFO, ICREA professor) meeting,
More informationQuantum Bilinear Optimisation
Quantum Bilinear Optimisation ariv:1506.08810 Mario Berta (IQIM Caltech), Omar Fawzi (ENS Lyon), Volkher Scholz (Ghent University) March 7th, 2016 Louisiana State University Quantum Bilinear Optimisation
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationTsirelson s problem and linear system games
IQC, University of Waterloo October 10th, 2016 includes joint work with Richard Cleve and Li Liu Non-local games x Referee y Win/lose based on outputs a, b and inputs x, y Alice Bob Alice and Bob must
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 informationGauge optimization and duality
1 / 54 Gauge optimization and duality Junfeng Yang Department of Mathematics Nanjing University Joint with Shiqian Ma, CUHK September, 2015 2 / 54 Outline Introduction Duality Lagrange duality Fenchel
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 informationConvergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets
Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets Milan Korda 1, Didier Henrion,3,4 Draft of December 1, 016 Abstract Moment-sum-of-squares hierarchies
More informationarxiv: v1 [math.oc] 31 Jan 2017
CONVEX CONSTRAINED SEMIALGEBRAIC VOLUME OPTIMIZATION: APPLICATION IN SYSTEMS AND CONTROL 1 Ashkan Jasour, Constantino Lagoa School of Electrical Engineering and Computer Science, Pennsylvania State University
More 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 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 informationA direct formulation for sparse PCA using semidefinite programming
A direct formulation for sparse PCA using semidefinite programming A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley A. d Aspremont, INFORMS, Denver,
More information5. Duality. Lagrangian
5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized
More informationMore Randomness From Noisy Sources
More Randomness From Noisy Sources Jean-Daniel Bancal and Valerio Scarani,2 Centre for Quantum Technologies, National University of Singapore 3 Science Drive 2, Singapore 7543 2 Department of Physics,
More informationSum of Squares Relaxations for Polynomial Semi-definite Programming
Sum of Squares Relaxations for Polynomial Semi-definite Programming C.W.J. Hol, C.W. Scherer Delft University of Technology, Delft Center of Systems and Control (DCSC) Mekelweg 2, 2628CD Delft, The Netherlands
More informationDual Decomposition.
1/34 Dual Decomposition http://bicmr.pku.edu.cn/~wenzw/opt-2017-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes Outline 2/34 1 Conjugate function 2 introduction:
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 informationDuality in Linear Programs. Lecturer: Ryan Tibshirani Convex Optimization /36-725
Duality in Linear Programs Lecturer: Ryan Tibshirani Convex Optimization 10-725/36-725 1 Last time: proximal gradient descent Consider the problem x g(x) + h(x) with g, h convex, g differentiable, and
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 informationTsirelson s problem and linear system games
IQC, University of Waterloo January 20th, 2017 includes joint work with Richard Cleve and Li Liu A speculative question Conventional wisdom: Finite time / volume / energy / etc. =) can always describe
More informationA direct formulation for sparse PCA using semidefinite programming
A direct formulation for sparse PCA using semidefinite programming A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley Available online at www.princeton.edu/~aspremon
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-2804 Research Reports on Mathematical and Computing Sciences Doubly Nonnegative Relaxations for Quadratic and Polynomial Optimization Problems with Binary and Box Constraints Sunyoung Kim, Masakazu
More informationMotivation. Lecture 2 Topics from Optimization and Duality. network utility maximization (NUM) problem:
CDS270 Maryam Fazel Lecture 2 Topics from Optimization and Duality Motivation network utility maximization (NUM) problem: consider a network with S sources (users), each sending one flow at rate x s, through
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 informationEnhanced Fritz John Optimality Conditions and Sensitivity Analysis
Enhanced Fritz John Optimality Conditions and Sensitivity Analysis Dimitri P. Bertsekas Laboratory for Information and Decision Systems Massachusetts Institute of Technology March 2016 1 / 27 Constrained
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 informationQuantum Measurement Uncertainty
Quantum Measurement Uncertainty New Relations for Qubits Paul Busch Department of Mathematics Siegen, 9 July 2015 Paul Busch (York) Quantum Measurement Uncertainty 1 / 40 Peter Mittelstaedt 1929-2014 Paul
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 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 informationSparse PCA with applications in finance
Sparse PCA with applications in finance A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley Available online at www.princeton.edu/~aspremon 1 Introduction
More informationConstrained optimization
Constrained optimization DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_fall17/index.html Carlos Fernandez-Granda Compressed sensing Convex constrained
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 informationLecture: Duality of LP, SOCP and SDP
1/33 Lecture: Duality of LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2017.html wenzw@pku.edu.cn Acknowledgement:
More informationLecture 3: Lagrangian duality and algorithms for the Lagrangian dual problem
Lecture 3: Lagrangian duality and algorithms for the Lagrangian dual problem Michael Patriksson 0-0 The Relaxation Theorem 1 Problem: find f := infimum f(x), x subject to x S, (1a) (1b) where f : R n R
More informationCONVEXITY IN SEMI-ALGEBRAIC GEOMETRY AND POLYNOMIAL OPTIMIZATION
CONVEXITY IN SEMI-ALGEBRAIC GEOMETRY AND POLYNOMIAL OPTIMIZATION JEAN B. LASSERRE Abstract. We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic
More informationECS289: Scalable Machine Learning
ECS289: Scalable Machine Learning Cho-Jui Hsieh UC Davis Sept 29, 2016 Outline Convex vs Nonconvex Functions Coordinate Descent Gradient Descent Newton s method Stochastic Gradient Descent Numerical Optimization
More information(Non-)Contextuality of Physical Theories as an Axiom
(Non-)Contextuality of Physical Theories as an Axiom Simone Severini Department of Computer Science QIP 2011 Plan 1. Introduction: non-contextuality 2. Results: a general framework to study non-contextuality;
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 informationAdvanced SDPs Lecture 6: March 16, 2017
Advanced SDPs Lecture 6: March 16, 2017 Lecturers: Nikhil Bansal and Daniel Dadush Scribe: Daniel Dadush 6.1 Notation Let N = {0, 1,... } denote the set of non-negative integers. For α N n, define the
More informationSemidefinite Programming
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 informationSemidefinite approximations of projections and polynomial images of semialgebraic sets
Semidefinite approximations of projections and polynomial images of semialgebraic sets Victor Magron 1 Didier Henrion 2,3,4 Jean-Bernard Lasserre 2,3 October 17, 2014 Abstract Given a compact semialgebraic
More informationSemidefinite Programming, Combinatorial Optimization and Real Algebraic Geometry
Semidefinite Programming, Combinatorial Optimization and Real Algebraic Geometry assoc. prof., Ph.D. 1 1 UNM - Faculty of information studies Edinburgh, 16. September 2014 Outline Introduction Definition
More informationRecent Developments of Alternating Direction Method of Multipliers with Multi-Block Variables
Recent Developments of Alternating Direction Method of Multipliers with Multi-Block Variables Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong 2014 Workshop
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 informationNewton s Method. Javier Peña Convex Optimization /36-725
Newton s Method Javier Peña Convex Optimization 10-725/36-725 1 Last time: dual correspondences Given a function f : R n R, we define its conjugate f : R n R, f ( (y) = max y T x f(x) ) x Properties and
More informationQuantum Measurement Uncertainty
Quantum Measurement Uncertainty Reading Heisenberg s mind or invoking his spirit? Paul Busch Department of Mathematics Quantum Physics and Logic QPL 2015, Oxford, 13-17 July 2015 Paul Busch (York) Quantum
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 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 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 information