On the local stability of semidefinite relaxations

Size: px
Start display at page:

Download "On the local stability of semidefinite relaxations"

Transcription

1 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 (U. Washington). arxiv: Real Algebraic Geometry and Optimization - ICERM Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 1 / 21

2 Nearest point problems Given a variety X R n, and a point θ R n, x x θ 2 s.t. x X A variety is the zero set of some polynomials X := {x R n : f 1 (x) = = f m (x) = 0} Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 2 / 21

3 Nearest point problems Given a variety X R n, and a point θ R n, x x θ 2 s.t. x X A variety is the zero set of some polynomials X := {x R n : f 1 (x) = = f m (x) = 0} This problem is nonconvex, and computationally challenging. SDP relaxations have been successful in several applications. Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 2 / 21

4 Nearest point problems Given a variety X R n, and a point θ R n, x x θ 2 s.t. x X A variety is the zero set of some polynomials X := {x R n : f 1 (x) = = f m (x) = 0} This problem is nonconvex, and computationally challenging. SDP relaxations have been successful in several applications. Goal Study the behavior of SDP relaxations in the low noise regime: when x is sufficiently close to X. Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 2 / 21

5 Nearest point problems Many different applications Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 3 / 21

6 Nearest point to the twisted cubic x X x θ 2, where X := {(x 1, x 2, x 3 ) : x 2 = x 2 1, x 3 = x 1 x 2 } The twisted cubic X can be parametrized as t (t, t 2, t 3 ). Its Lagrangian dual is the following SDP: max γ,λ 1,λ 2 R γ, s.t. γ+ θ 2 θ 1 λ 1 θ 2 λ 2 θ 3 θ 1 1 2λ 1 λ λ 1 θ 2 λ λ 2 θ Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 4 / 21

7 Nearest point to the twisted cubic x X x θ 2, where X := {(x 1, x 2, x 3 ) : x 2 = x 2 1, x 3 = x 1 x 2 } 3 Nearest point to the twisted cubic zero duality gap = duality gap Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 4 / 21

8 Nearest point problem to a quadratic variety Theorem If θ X is a regular point then there is zero-duality-gap for any θ R n that is sufficiently close to θ. Applications: Triangulation problem [Aholt-Agarwal-Thomas] Nearest (symmetric) rank one tensor Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 5 / 21

9 Parametrized QCQPs Consider a family of quadratically constrained programs (QCQPs): x R N g θ (x) h i θ(x) = 0 for i = 1,..., m (P θ ) where g θ, hθ i are quadratic, and the dependence on θ is continuous. The Lagrangian dual is an SDP. Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 6 / 21

10 Parametrized QCQPs Consider a family of quadratically constrained programs (QCQPs): x R N g θ (x) h i θ(x) = 0 for i = 1,..., m (P θ ) where g θ, hθ i are quadratic, and the dependence on θ is continuous. The Lagrangian dual is an SDP. Goal: Given θ for which the SDP relaxation is tight, analyze the behavior as θ θ. Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 6 / 21

11 Parametrized QCQPs Consider a family of quadratically constrained programs (QCQPs): x R N g θ (x) h i θ(x) = 0 for i = 1,..., m (P θ ) where g θ, hθ i are quadratic, and the dependence on θ is continuous. The Lagrangian dual is an SDP. Goal: Given θ for which the SDP relaxation is tight, analyze the behavior as θ θ. Example: For a nearest point problem g θ (x) := x θ 2, h i (x) independent of θ The problem is trivial for any θ X. Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 6 / 21

12 SDP relaxation of a (homogeneous) QCQP Primal problem Dual problem x R N max λ R m x T G θ x x T H i θx = b i i = 1,..., m d(λ) := i λ ib i Q θ (λ) 0 where Q θ (λ) is the Hessian of the Lagrangian (P θ ) (D θ ) Q θ (λ) := G θ + i λ i H i θ S N. Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 7 / 21

13 SDP relaxation of a (homogeneous) QCQP Primal problem Dual problem x R N max λ R m x T G θ x x T H i θx = b i i = 1,..., m d(λ) := i λ ib i Q θ (λ) 0 (P θ ) (D θ ) Problem statement Assume that val(p θ ) = val(d θ ), i.e., θ is a zero-duality-gap parameter. Find conditions under which val(p θ ) = val(d θ ) when θ is close to θ. Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 7 / 21

14 Characterization of zero-duality-gap Given x θ primal feasible, its Lagrange multipliers are: Lemma λ Λ θ (x θ ) λ T h θ (x θ ) = g θ (x θ ) Q θ (λ)x θ = 0. Let x θ R N, λ R m. Then x θ is optimal to (P θ ) and λ is optimal to (D θ ) with val(p θ ) = val(d θ ) iff: 1 h θ (x θ ) = 0 (primal feasibility). 2 Q θ (λ) 0 (dual feasibility). 3 λ Λ θ (x θ ) (complementarity). Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 8 / 21

15 Characterization of zero-duality-gap Given x θ primal feasible, its Lagrange multipliers are: Lemma λ Λ θ (x θ ) λ T h θ (x θ ) = g θ (x θ ) Q θ (λ)x θ = 0. Let x θ R N, λ R m. Then x θ is optimal to (P θ ) and λ is optimal to (D θ ) with val(p θ ) = val(d θ ) iff: 1 h θ (x θ ) = 0 (primal feasibility). 2 Q θ (λ) 0 (dual feasibility). 3 λ Λ θ (x θ ) (complementarity). Proof. If Q θ (λ)x θ = 0 and h θ (x θ ) = 0, then 0 = x T θ Q θ (λ)x θ = x T θ G θ x θ + i λ i x T θ H i x θ = g θ (x θ ) d(λ). Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 8 / 21

16 Characterization of zero-duality-gap Lemma Let θ be a zero-duality-gap parameter with ( x, λ) primal/dual optimal. Assume that 1 Q θ( λ) has corank-one (strict-complementarity) 2 x θ feasible for (P θ ), λ θ Λ θ (x θ ) s.t. (x θ, λ θ ) θ θ ( x, λ). Then there is zero-duality-gap when θ is close to θ. Proof. Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 9 / 21

17 Characterization of zero-duality-gap Lemma Let θ be a zero-duality-gap parameter with ( x, λ) primal/dual optimal. Assume that 1 Q θ( λ) has corank-one (strict-complementarity) 2 x θ feasible for (P θ ), λ θ Λ θ (x θ ) s.t. (x θ, λ θ ) θ θ ( x, λ). Then there is zero-duality-gap when θ is close to θ. Proof. Q θ (λ θ ) has a zero eigenvalue (Q θ (λ θ )x θ = 0). Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 9 / 21

18 Characterization of zero-duality-gap Lemma Let θ be a zero-duality-gap parameter with ( x, λ) primal/dual optimal. Assume that 1 Q θ( λ) has corank-one (strict-complementarity) 2 x θ feasible for (P θ ), λ θ Λ θ (x θ ) s.t. (x θ, λ θ ) θ θ ( x, λ). Then there is zero-duality-gap when θ is close to θ. Proof. Q θ (λ θ ) has a zero eigenvalue (Q θ (λ θ )x θ = 0). Q θ (λ θ ) Q θ( λ) (the dependence on θ is continuous). Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 9 / 21

19 Characterization of zero-duality-gap Lemma Let θ be a zero-duality-gap parameter with ( x, λ) primal/dual optimal. Assume that 1 Q θ( λ) has corank-one (strict-complementarity) 2 x θ feasible for (P θ ), λ θ Λ θ (x θ ) s.t. (x θ, λ θ ) θ θ ( x, λ). Then there is zero-duality-gap when θ is close to θ. Proof. Q θ (λ θ ) has a zero eigenvalue (Q θ (λ θ )x θ = 0). Q θ (λ θ ) Q θ( λ) (the dependence on θ is continuous). Q θ( λ) has N 1 positive eigenvalues. Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 9 / 21

20 Characterization of zero-duality-gap Lemma Let θ be a zero-duality-gap parameter with ( x, λ) primal/dual optimal. Assume that 1 Q θ( λ) has corank-one (strict-complementarity) 2 x θ feasible for (P θ ), λ θ Λ θ (x θ ) s.t. (x θ, λ θ ) θ θ ( x, λ). Then there is zero-duality-gap when θ is close to θ. Proof. Q θ (λ θ ) has a zero eigenvalue (Q θ (λ θ )x θ = 0). Q θ (λ θ ) Q θ( λ) (the dependence on θ is continuous). Q θ( λ) has N 1 positive eigenvalues. Q θ (λ θ ) also has N 1 positive eigenvalues (continuity of eigenvalues). Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 9 / 21

21 Characterization of zero-duality-gap Lemma Let θ be a zero-duality-gap parameter with ( x, λ) primal/dual optimal. Assume that 1 Q θ( λ) has corank-one (strict-complementarity) 2 x θ feasible for (P θ ), λ θ Λ θ (x θ ) s.t. (x θ, λ θ ) θ θ ( x, λ). Then there is zero-duality-gap when θ is close to θ. Proof. Q θ (λ θ ) has a zero eigenvalue (Q θ (λ θ )x θ = 0). Q θ (λ θ ) Q θ( λ) (the dependence on θ is continuous). Q θ( λ) has N 1 positive eigenvalues. Q θ (λ θ ) also has N 1 positive eigenvalues (continuity of eigenvalues). Q θ (λ θ ) 0, so there is zero-duality-gap. Cifuentes (MIT) Stability of semidefinite relaxations ICERM 18 9 / 21

22 Nearest point to a quadratic variety x X x θ 2, where X := {x R n : f 1 (x) = = f m (x) = 0} Theorem Let θ be a regular point of X, i.e. rank f ( θ) = codim X. Then there is zero-duality-gap for θ close to θ. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

23 Nearest point to a quadratic variety x X x θ 2, where X := {x R n : f 1 (x) = = f m (x) = 0} Theorem Let θ be a regular point of X, i.e. rank f ( θ) = codim X. Then there is zero-duality-gap for θ close to θ. Proof. Since θ X, then x = θ, and λ = 0. Need to find λ θ Λ θ (x θ ) s.t. λ θ θ θ 0. Regularity implies λ θ 2 σ( f ) x θ θ θ θ 0. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

24 Nearest point to a quadratic variety x X x θ 2, where X := {x R n : f 1 (x) = = f m (x) = 0} Theorem Let θ be a regular point of X, i.e. rank f ( θ) = codim X. Then there is zero-duality-gap for θ close to θ. Proof. Since θ X, then x = θ, and λ = 0. Need to find λ θ Λ θ (x θ ) s.t. λ θ θ θ 0. Regularity implies λ θ 2 σ( f ) x θ θ θ θ 0. Remark: The theorem generalizes to the case of strictly convex objective. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

25 Guaranteed region of zero-duality-gap x X x θ 2, where X := {x R 3 : x 2 = x 2 1, x 3 = x 1 x 2 } 6 4 zero duality gap Y Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

26 Application: Triangulation [Aholt-Agarwal-Thomas] Problem Given noisy images û j R 2 of an unknown point, u U u j û j 2 where U is the multiview variety of the cameras. j Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

27 Application: Triangulation [Aholt-Agarwal-Thomas] Problem Given noisy images û j R 2 of an unknown point, u U u j û j 2 where U is the multiview variety of the cameras. j If either n = 2, or n 4 and the camera centers are not coplanar, then U is defined by the (quadratic) epipolar constraints. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

28 Application: Triangulation [Aholt-Agarwal-Thomas] Problem Given noisy images û j R 2 of an unknown point, u U u j û j 2 where U is the multiview variety of the cameras. j If either n = 2, or n 4 and the camera centers are not coplanar, then U is defined by the (quadratic) epipolar constraints. The regularity condition is easy to check. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

29 Application: Triangulation [Aholt-Agarwal-Thomas] Problem Given noisy images û j R 2 of an unknown point, u U u j û j 2 where U is the multiview variety of the cameras. j If either n = 2, or n 4 and the camera centers are not coplanar, then U is defined by the (quadratic) epipolar constraints. The regularity condition is easy to check. Under low noise the SDP relaxation is tight. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

30 Application: Rank one approximation Problem Given a tensor ˆx R n 1 n l, consider x X x ˆx 2 where X is the variety of rank one tensors (Segre). Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

31 Application: Rank one approximation Problem Given a tensor ˆx R n 1 n l, consider x X x ˆx 2 where X is the variety of rank one tensors (Segre). The Segre variety is defined by quadratics (2 2 ors). Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

32 Application: Rank one approximation Problem Given a tensor ˆx R n 1 n l, consider x X x ˆx 2 where X is the variety of rank one tensors (Segre). The Segre variety is defined by quadratics (2 2 ors). Thus, the SDP relaxation is tight under low noise. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

33 Application: Rotation synchronization Problem Given a graph G = (V, E) and matrices ˆR ij R d d for ij E, R 1,...,R n SO(d) R j ˆR ij R i 2 F ij E Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

34 Application: Rotation synchronization Problem Given a graph G = (V, E) and matrices ˆR ij R d d for ij E, R 1,...,R n SO(d) R j ˆR ij R i 2 F ij E The objective function is strictly convex. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

35 Application: Rotation synchronization Problem Given a graph G = (V, E) and matrices ˆR ij R d d for ij E, R 1,...,R n SO(d) R j ˆR ij R i 2 F ij E The objective function is strictly convex. Thus, the SDP relaxation is tight under low noise. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

36 Application: Rotation synchronization Problem Given a graph G = (V, E) and matrices ˆR ij R d d for ij E, R 1,...,R n SO(d) R j ˆR ij R i 2 F ij E The objective function is strictly convex. Thus, the SDP relaxation is tight under low noise. Similar tightness results have been shown [Fredriksson-Olsson], [Rosen-Carlone-Bandeira-Leonard], [Wang-Singer]. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

37 Application: Orthogonal Procrustes Problem Given matrices A R m 1 n, B R m 1 m 2, C R k m 2, X St(n,k) AXC B 2 F where St(n, k) is the Stiefel manifold. The objective function is strictly convex. Thus, the SDP relaxation is tight under low noise. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

38 Nearest point to non-quadratic varieties Any variety can be described by quadratics by using auxiliary variables. Example: Nearest point problem to the curve y 2 2 = y 3 1 can be written as y θ 2, s.t. y 2 = y 1 z, y 1 = z 2, y 2 z = y1 2. y R 2,z R The objective is not strict convex z y y Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

39 Stability of SDP relaxations of (arbitrary) QCQPs Consider a general family of QCQPs: x R N g θ (x) h i θ(x) = 0 for i = 1,..., m (P θ ) Let θ be a zero-duality-gap parameter: val(p θ ) = val(d θ ). Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

40 Stability of SDP relaxations of (arbitrary) QCQPs Consider a general family of QCQPs: x R N g θ (x) h i θ(x) = 0 for i = 1,..., m (P θ ) Let θ be a zero-duality-gap parameter: val(p θ ) = val(d θ ). There are bad cases, where the SDP relaxation is non-informative. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

41 Stability of SDP relaxations of (arbitrary) QCQPs Consider a general family of QCQPs: x R N g θ (x) h i θ(x) = 0 for i = 1,..., m (P θ ) Let θ be a zero-duality-gap parameter: val(p θ ) = val(d θ ). There are bad cases, where the SDP relaxation is non-informative. We introduce a Slater-type condition that guarantees zero-duality-gap nearby θ. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

42 Stability of SDP relaxations of QCQPs Let θ be a zero-duality-gap parameter with ( x, λ) primal/dual optimal. Assumption (restricted Slater) There is µ R m s.t. the quadratic function Ψ µ (x) := i µ ih ī (x) satisfies: θ Ψ µ ( x) = 0, and Ψ µ is strictly convex on ker Q θ( λ). Theorem Under the restricted Slater assumption and some regularity conditions, there is zero-duality-gap when θ is close to θ. Moreover, the SDP recovers the imizer. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

43 Stability of SDP relaxations of QCQPs Let θ be a zero-duality-gap parameter with ( x, λ) primal/dual optimal. Assumption (restricted Slater) There is µ R m s.t. the quadratic function Ψ µ (x) := i µ ih ī (x) satisfies: θ Ψ µ ( x) = 0, and Ψ µ is strictly convex on ker Q θ( λ). Theorem Under the restricted Slater assumption and some regularity conditions, there is zero-duality-gap when θ is close to θ. Moreover, the SDP recovers the imizer. Applications (ongoing): Higher levels of SOS/Lasserre hierarchy. For instance: system identification, noisy deconvolution, camera resectioning, homography estimation, approximate GCD. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

44 Using geometry to derive smaller SDP relaxations Primal problem x X x T Gx X = {x : x T H i x = b i for i = 1,..., m} Dual problem max λ R m,q S N i λ ib i Q = G + i λ ih i Q 0 Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

45 Using geometry to derive smaller SDP relaxations Primal problem x X x T Gx X = {x : x T H i x = b i for i = 1,..., m} Dual problem Let ˆx 1,, ˆx S X max λ R m,q S N i λ ib i ˆx T j Qˆx j = ˆx j T Gˆx j + i λ i ˆx j T H i ˆx j for j = 1,..., S Q 0 Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

46 Using geometry to derive smaller SDP relaxations Primal problem x X x T Gx X = {x : x T H i x = b i for i = 1,..., m} Dual problem Let ˆx 1,, ˆx S X max λ R m,q S N i λ ib i ˆx j T Qˆx j = ˆx j T Gˆx j + i λ ib i for j = 1,..., S Q 0 Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

47 Using geometry to derive smaller SDP relaxations Primal problem x X x T Gx X = {x : x T H i x = b i for i = 1,..., m} Dual problem Let ˆx 1,, ˆx S X max γ R,Q S N γ ˆx j T Qˆx j = ˆx j T Gˆx j + γ for j = 1,..., S Q 0 SDP is smaller, e.g., the multipliers λ R m disappear. relaxation is stronger. Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

48 Example: Orthogonal Procrustes Problem Given matrices A R m 1 n, B R m 1 m 2, C R k m 2, X St(n,k) AXC B 2 F where St(n, k) is the Stiefel manifold. n r Equations SDP Gröbner Sampling SDP variables constraints time(s) basis (s) variables constraints time(s) Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

49 Summary We analyzed the local stability of SDP relaxations. Found sufficient conditions for zero-duality-gap nearby θ. Many applications (triangulation, rank one approximation, rotation synchronization, orthogonal Procrustes). Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

50 Summary We analyzed the local stability of SDP relaxations. Found sufficient conditions for zero-duality-gap nearby θ. Many applications (triangulation, rank one approximation, rotation synchronization, orthogonal Procrustes). If you want to know more: D. Cifuentes, S. Agarwal, P. Parrilo, R. Thomas, On the local stability of semidefinite relaxations, arxiv: D. Cifuentes, C. Harris, B. Sturmfels, The geometry of SDP-exactness in quadratic optimization, arxiv: D. Cifuentes, P. Parrilo, Sampling algebraic varieties for sum of squares programs, arxiv: Thanks for your attention! Cifuentes (MIT) Stability of semidefinite relaxations ICERM / 21

4. Algebra and Duality

4. 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 information

Sparse Optimization Lecture: Dual Certificate in l 1 Minimization

Sparse 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 information

14. Duality. ˆ Upper and lower bounds. ˆ General duality. ˆ Constraint qualifications. ˆ Counterexample. ˆ Complementary slackness.

14. Duality. ˆ Upper and lower bounds. ˆ General duality. ˆ Constraint qualifications. ˆ Counterexample. ˆ Complementary slackness. CS/ECE/ISyE 524 Introduction to Optimization Spring 2016 17 14. Duality ˆ Upper and lower bounds ˆ General duality ˆ Constraint qualifications ˆ Counterexample ˆ Complementary slackness ˆ Examples ˆ Sensitivity

More information

SEMIDEFINITE PROGRAM BASICS. Contents

SEMIDEFINITE 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 information

Duality. 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 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 information

MIT Algebraic techniques and semidefinite optimization February 14, Lecture 3

MIT 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 information

Optimization for Communications and Networks. Poompat Saengudomlert. Session 4 Duality and Lagrange Multipliers

Optimization for Communications and Networks. Poompat Saengudomlert. Session 4 Duality and Lagrange Multipliers Optimization for Communications and Networks Poompat Saengudomlert Session 4 Duality and Lagrange Multipliers P Saengudomlert (2015) Optimization Session 4 1 / 14 24 Dual Problems Consider a primal convex

More information

Example: feasibility. Interpretation as formal proof. Example: linear inequalities and Farkas lemma

Example: 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 information

I.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010

I.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 information

Semidefinite Programming Basics and Applications

Semidefinite 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 information

EE 227A: Convex Optimization and Applications October 14, 2008

EE 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 information

Lecture Note 5: Semidefinite Programming for Stability Analysis

Lecture 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 information

E5295/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 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 information

Convex Optimization & Lagrange Duality

Convex Optimization & Lagrange Duality Convex Optimization & Lagrange Duality Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Convex optimization Optimality condition Lagrange duality KKT

More information

Lift me up but not too high Fast algorithms to solve SDP s with block-diagonal constraints

Lift me up but not too high Fast algorithms to solve SDP s with block-diagonal constraints Lift me up but not too high Fast algorithms to solve SDP s with block-diagonal constraints Nicolas Boumal Université catholique de Louvain (Belgium) IDeAS seminar, May 13 th, 2014, Princeton The Riemannian

More information

Lagrange 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) 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 information

Strong duality in Lasserre s hierarchy for polynomial optimization

Strong 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 information

Global Optimization of Polynomials

Global 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 information

Convex Optimization M2

Convex Optimization M2 Convex Optimization M2 Lecture 8 A. d Aspremont. Convex Optimization M2. 1/57 Applications A. d Aspremont. Convex Optimization M2. 2/57 Outline Geometrical problems Approximation problems Combinatorial

More information

Convex Optimization M2

Convex 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 information

Introduction to Machine Learning Lecture 7. Mehryar Mohri Courant Institute and Google Research

Introduction to Machine Learning Lecture 7. Mehryar Mohri Courant Institute and Google Research Introduction to Machine Learning Lecture 7 Mehryar Mohri Courant Institute and Google Research mohri@cims.nyu.edu Convex Optimization Differentiation Definition: let f : X R N R be a differentiable function,

More information

Complexity of Deciding Convexity in Polynomial Optimization

Complexity 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 information

5. Duality. Lagrangian

5. 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 information

Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs

Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs Raphael Louca & Eilyan Bitar School of Electrical and Computer Engineering American Control Conference (ACC) Chicago,

More information

Convexification of Mixed-Integer Quadratically Constrained Quadratic Programs

Convexification 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 information

Semidefinite Programming

Semidefinite 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 information

DUALITY, OPTIMALITY CONDITIONS AND PERTURBATION ANALYSIS

DUALITY, OPTIMALITY CONDITIONS AND PERTURBATION ANALYSIS 1 DUALITY, OPTIMALITY CONDITIONS AND PERTURBATION ANALYSIS Alexander Shapiro 1 School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205, USA, E-mail: ashapiro@isye.gatech.edu

More information

Polynomials in Multiview Geometry

Polynomials in Multiview Geometry Polynomials in Multiview Geometry Christopher Aholt A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy University of Washington 2012 Reading Committee:

More information

Network Localization via Schatten Quasi-Norm Minimization

Network Localization via Schatten Quasi-Norm Minimization Network Localization via Schatten Quasi-Norm Minimization Anthony Man-Cho So Department of Systems Engineering & Engineering Management The Chinese University of Hong Kong (Joint Work with Senshan Ji Kam-Fung

More information

Constrained Optimization and Lagrangian Duality

Constrained 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 information

Facial reduction for Euclidean distance matrix problems

Facial reduction for Euclidean distance matrix problems Facial reduction for Euclidean distance matrix problems Nathan Krislock Department of Mathematical Sciences Northern Illinois University, USA Distance Geometry: Theory and Applications DIMACS Center, Rutgers

More information

Interior Point Algorithms for Constrained Convex Optimization

Interior Point Algorithms for Constrained Convex Optimization Interior Point Algorithms for Constrained Convex Optimization Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Inequality constrained minimization problems

More information

Duality. Geoff Gordon & Ryan Tibshirani Optimization /

Duality. 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 information

Lecture: Introduction to LP, SDP and SOCP

Lecture: 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 information

Multiuser Downlink Beamforming: Rank-Constrained SDP

Multiuser Downlink Beamforming: Rank-Constrained SDP Multiuser Downlink Beamforming: Rank-Constrained SDP Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2018-19, HKUST, Hong Kong Outline of Lecture

More information

Convex Optimization. Dani Yogatama. School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA. February 12, 2014

Convex Optimization. Dani Yogatama. School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA. February 12, 2014 Convex Optimization Dani Yogatama School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA February 12, 2014 Dani Yogatama (Carnegie Mellon University) Convex Optimization February 12,

More information

Quadratic reformulation techniques for 0-1 quadratic programs

Quadratic 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 information

Lecture 3: Lagrangian duality and algorithms for the Lagrangian dual problem

Lecture 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 information

ELE539A: 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 ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March

More information

Computer Science and Artificial Intelligence Laboratory Technical Report. MIT-CSAIL-TR February 5, 2017

Computer Science and Artificial Intelligence Laboratory Technical Report. MIT-CSAIL-TR February 5, 2017 Computer Science and Artificial Intelligence Laboratory Technical Report MIT-CSAIL-TR-2017-002 February 5, 2017 SE-Sync: A Certifiably Correct Algorithm for Synchronization over the Special Euclidean Group

More information

Additional Homework Problems

Additional Homework Problems Additional Homework Problems Robert M. Freund April, 2004 2004 Massachusetts Institute of Technology. 1 2 1 Exercises 1. Let IR n + denote the nonnegative orthant, namely IR + n = {x IR n x j ( ) 0,j =1,...,n}.

More information

Convex sets, conic matrix factorizations and conic rank lower bounds

Convex 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 information

Lectures 9 and 10: Constrained optimization problems and their optimality conditions

Lectures 9 and 10: Constrained optimization problems and their optimality conditions Lectures 9 and 10: Constrained optimization problems and their optimality conditions Coralia Cartis, Mathematical Institute, University of Oxford C6.2/B2: Continuous Optimization Lectures 9 and 10: Constrained

More information

BURER-MONTEIRO GUARANTEES FOR GENERAL SEMIDEFINITE PROGRAMS arxiv: v1 [math.oc] 15 Apr 2019

BURER-MONTEIRO GUARANTEES FOR GENERAL SEMIDEFINITE PROGRAMS arxiv: v1 [math.oc] 15 Apr 2019 BURER-MONTEIRO GUARANTEES FOR GENERAL SEMIDEFINITE PROGRAMS arxiv:1904.07147v1 [math.oc] 15 Apr 2019 DIEGO CIFUENTES Abstract. Consider a semidefinite program (SDP) involving an n n positive semidefinite

More information

Chordal structure in computer algebra: Permanents

Chordal structure in computer algebra: Permanents Chordal structure in computer algebra: Permanents Diego Cifuentes Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology Joint

More information

Voronoi Cells of Varieties

Voronoi Cells of Varieties Voronoi Cells of Varieties arxiv:1811.08395v1 [math.ag] 20 Nov 2018 Diego Cifuentes, Kristian Ranestad, Bernd Sturmfels and Madeleine Weinstein Abstract Every real algebraic variety determines a Voronoi

More information

Lecture 7: Convex Optimizations

Lecture 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 information

6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC

6-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 information

Copositive Programming and Combinatorial Optimization

Copositive 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 information

Lecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.

Lecture 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 information

Machine Learning 4771

Machine Learning 4771 Machine Learning 477 Instructor: Tony Jebara Topic 5 Generalization Guarantees VC-Dimension Nearest Neighbor Classification (infinite VC dimension) Structural Risk Minimization Support Vector Machines

More information

Copositive Programming and Combinatorial Optimization

Copositive 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 information

Part IB Optimisation

Part IB Optimisation Part IB Optimisation Theorems Based on lectures by F. A. Fischer Notes taken by Dexter Chua Easter 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after

More information

Fast Angular Synchronization for Phase Retrieval via Incomplete Information

Fast Angular Synchronization for Phase Retrieval via Incomplete Information Fast Angular Synchronization for Phase Retrieval via Incomplete Information Aditya Viswanathan a and Mark Iwen b a Department of Mathematics, Michigan State University; b Department of Mathematics & Department

More information

1 The independent set problem

1 The independent set problem ORF 523 Lecture 11 Spring 2016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Tuesday, March 29, 2016 When in doubt on the accuracy of these notes, please cross chec with the instructor

More information

Relaxations and Randomized Methods for Nonconvex QCQPs

Relaxations 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 information

Robust and Optimal Control, Spring 2015

Robust 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 information

Lecture Semidefinite Programming and Graph Partitioning

Lecture Semidefinite Programming and Graph Partitioning Approximation Algorithms and Hardness of Approximation April 16, 013 Lecture 14 Lecturer: Alantha Newman Scribes: Marwa El Halabi 1 Semidefinite Programming and Graph Partitioning In previous lectures,

More information

CONVEX ALGEBRAIC GEOMETRY. Bernd Sturmfels UC Berkeley

CONVEX ALGEBRAIC GEOMETRY. Bernd Sturmfels UC Berkeley CONVEX ALGEBRAIC GEOMETRY Bernd Sturmfels UC Berkeley Multifocal Ellipses Given m points (u 1, v 1 ),...,(u m, v m )intheplaner 2,and aradiusd > 0, their m-ellipse is the convex algebraic curve { (x, y)

More information

Convex Optimization Boyd & Vandenberghe. 5. Duality

Convex Optimization Boyd & Vandenberghe. 5. Duality 5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized

More information

EE/AA 578, Univ of Washington, Fall Duality

EE/AA 578, Univ of Washington, Fall Duality 7. Duality EE/AA 578, Univ of Washington, Fall 2016 Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized

More information

Introduction to Nonlinear Stochastic Programming

Introduction to Nonlinear Stochastic Programming School of Mathematics T H E U N I V E R S I T Y O H F R G E D I N B U Introduction to Nonlinear Stochastic Programming Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio SPS

More information

9. Interpretations, Lifting, SOS and Moments

9. Interpretations, Lifting, SOS and Moments 9-1 Interpretations, Lifting, SOS and Moments P. Parrilo and S. Lall, CDC 2003 2003.12.07.04 9. Interpretations, Lifting, SOS and Moments Polynomial nonnegativity Sum of squares (SOS) decomposition Eample

More information

Lagrangian Duality. Richard Lusby. Department of Management Engineering Technical University of Denmark

Lagrangian Duality. Richard Lusby. Department of Management Engineering Technical University of Denmark Lagrangian Duality Richard Lusby Department of Management Engineering Technical University of Denmark Today s Topics (jg Lagrange Multipliers Lagrangian Relaxation Lagrangian Duality R Lusby (42111) Lagrangian

More information

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems Robert M. Freund February 2016 c 2016 Massachusetts Institute of Technology. All rights reserved. 1 1 Introduction

More information

Trust 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 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 information

Positive semidefinite rank

Positive semidefinite rank 1/15 Positive semidefinite rank Hamza Fawzi (MIT, LIDS) Joint work with João Gouveia (Coimbra), Pablo Parrilo (MIT), Richard Robinson (Microsoft), James Saunderson (Monash), Rekha Thomas (UW) DIMACS Workshop

More information

A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint

A 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 information

Lecture: Duality.

Lecture: Duality. Lecture: Duality http://bicmr.pku.edu.cn/~wenzw/opt-2016-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghe s lecture notes Introduction 2/35 Lagrange dual problem weak and strong

More information

Positive Semidefinite Matrix Completion, Universal Rigidity and the Strong Arnold Property

Positive Semidefinite Matrix Completion, Universal Rigidity and the Strong Arnold Property Positive Semidefinite Matrix Completion, Universal Rigidity and the Strong Arnold Property M. Laurent a,b, A. Varvitsiotis a, a Centrum Wiskunde & Informatica (CWI), Science Park 123, 1098 XG Amsterdam,

More information

POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS

POLYNOMIAL 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 information

SDP Relaxations for MAXCUT

SDP Relaxations for MAXCUT SDP Relaxations for MAXCUT from Random Hyperplanes to Sum-of-Squares Certificates CATS @ UMD March 3, 2017 Ahmed Abdelkader MAXCUT SDP SOS March 3, 2017 1 / 27 Overview 1 MAXCUT, Hardness and UGC 2 LP

More information

Relations between Semidefinite, Copositive, Semi-infinite and Integer Programming

Relations between Semidefinite, Copositive, Semi-infinite and Integer Programming Relations between Semidefinite, Copositive, Semi-infinite and Integer Programming Author: Faizan Ahmed Supervisor: Dr. Georg Still Master Thesis University of Twente the Netherlands May 2010 Relations

More information

Approximation Algorithms

Approximation Algorithms Approximation Algorithms Chapter 26 Semidefinite Programming Zacharias Pitouras 1 Introduction LP place a good lower bound on OPT for NP-hard problems Are there other ways of doing this? Vector programs

More information

Duality Uses and Correspondences. Ryan Tibshirani Convex Optimization

Duality Uses and Correspondences. Ryan Tibshirani Convex Optimization Duality Uses and Correspondences Ryan Tibshirani Conve Optimization 10-725 Recall that for the problem Last time: KKT conditions subject to f() h i () 0, i = 1,... m l j () = 0, j = 1,... r the KKT conditions

More information

c 2000 Society for Industrial and Applied Mathematics

c 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 information

Lecture: Duality of LP, SOCP and SDP

Lecture: 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 information

Nonlinear Optimization: What s important?

Nonlinear Optimization: What s important? Nonlinear Optimization: What s important? Julian Hall 10th May 2012 Convexity: convex problems A local minimizer is a global minimizer A solution of f (x) = 0 (stationary point) is a minimizer A global

More information

Lecture 8. Strong Duality Results. September 22, 2008

Lecture 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 information

Optimization in Wireless Communication

Optimization in Wireless Communication Zhi-Quan (Tom) Luo Department of Electrical and Computer Engineering University of Minnesota 200 Union Street SE Minneapolis, MN 55455 2007 NSF Workshop Challenges Optimization problems from wireless applications

More information

Generalization to inequality constrained problem. Maximize

Generalization to inequality constrained problem. Maximize Lecture 11. 26 September 2006 Review of Lecture #10: Second order optimality conditions necessary condition, sufficient condition. If the necessary condition is violated the point cannot be a local minimum

More information

The convex algebraic geometry of rank minimization

The convex algebraic geometry of rank minimization The convex algebraic geometry of rank minimization Pablo A. Parrilo Laboratory for Information and Decision Systems Massachusetts Institute of Technology International Symposium on Mathematical Programming

More information

Summer School: Semidefinite Optimization

Summer 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 information

Lagrangian-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 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 information

Duality Theory of Constrained Optimization

Duality Theory of Constrained Optimization Duality Theory of Constrained Optimization Robert M. Freund April, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 The Practical Importance of Duality Duality is pervasive

More information

A Unified Theorem on SDP Rank Reduction. yyye

A 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 information

Primal-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 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 information

Facial Reduction for Cone Optimization

Facial Reduction for Cone Optimization Facial Reduction for Cone Optimization Henry Wolkowicz Dept. Combinatorics and Optimization University of Waterloo Tuesday Apr. 21, 2015 (with: Drusvyatskiy, Krislock, (Cheung) Voronin) Motivation: Loss

More information

Machine Learning. Support Vector Machines. Manfred Huber

Machine Learning. Support Vector Machines. Manfred Huber Machine Learning Support Vector Machines Manfred Huber 2015 1 Support Vector Machines Both logistic regression and linear discriminant analysis learn a linear discriminant function to separate the data

More information

Convex Optimization and Modeling

Convex Optimization and Modeling Convex Optimization and Modeling Duality Theory and Optimality Conditions 5th lecture, 12.05.2010 Jun.-Prof. Matthias Hein Program of today/next lecture Lagrangian and duality: the Lagrangian the dual

More information

The Algebraic Degree of Semidefinite Programming

The Algebraic Degree of Semidefinite Programming The Algebraic Degree ofsemidefinite Programming p. The Algebraic Degree of Semidefinite Programming BERND STURMFELS UNIVERSITY OF CALIFORNIA, BERKELEY joint work with and Jiawang Nie (IMA Minneapolis)

More information

A notion of Total Dual Integrality for Convex, Semidefinite and Extended Formulations

A 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 information

Towards Solving Bilevel Optimization Problems in Quantum Information Theory

Towards Solving Bilevel Optimization Problems in Quantum Information Theory 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

More information

Projection methods to solve SDP

Projection methods to solve SDP Projection methods to solve SDP Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria F. Rendl, Oberwolfach Seminar, May 2010 p.1/32 Overview Augmented Primal-Dual Method

More information

Donald Goldfarb IEOR Department Columbia University UCLA Mathematics Department Distinguished Lecture Series May 17 19, 2016

Donald Goldfarb IEOR Department Columbia University UCLA Mathematics Department Distinguished Lecture Series May 17 19, 2016 Optimization for Tensor Models Donald Goldfarb IEOR Department Columbia University UCLA Mathematics Department Distinguished Lecture Series May 17 19, 2016 1 Tensors Matrix Tensor: higher-order matrix

More information

Math Matrix Algebra

Math Matrix Algebra Math 44 - Matrix Algebra Review notes - (Alberto Bressan, Spring 7) sec: Orthogonal diagonalization of symmetric matrices When we seek to diagonalize a general n n matrix A, two difficulties may arise:

More information

Appendix A Taylor Approximations and Definite Matrices

Appendix A Taylor Approximations and Definite Matrices Appendix A Taylor Approximations and Definite Matrices Taylor approximations provide an easy way to approximate a function as a polynomial, using the derivatives of the function. We know, from elementary

More information

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 4

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 4 Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 4 Instructor: Farid Alizadeh Scribe: Haengju Lee 10/1/2001 1 Overview We examine the dual of the Fermat-Weber Problem. Next we will

More information

Nonconvex Quadratic Programming: Return of the Boolean Quadric Polytope

Nonconvex 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 information

8 Approximation Algorithms and Max-Cut

8 Approximation Algorithms and Max-Cut 8 Approximation Algorithms and Max-Cut 8. The Max-Cut problem Unless the widely believed P N P conjecture is false, there is no polynomial algorithm that can solve all instances of an NP-hard problem.

More information