Primal-dual IPM with Asymmetric Barrier
|
|
- Coleen Cummings
- 5 years ago
- Views:
Transcription
1 Primal-dual IPM with Asymmetric Barrier Yurii Nesterov, CORE/INMA (UCL) September 29, 2008 (IFOR, ETHZ) Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 1/28
2 Outline 1 Symmetric and asymmetric barriers 2 Feasible-start potential reduction IPM 3 Infeasible start potential-reduction IPM 4 Infeasible-start long-step path-following IPM 5 Computational aspects Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 2/28
3 Nonlinear Conic Optimization Problem Primal-Dual Problem: min x { c, x : Ax = b, x K}? = max s,y { b, y : s+a y = c, s K }, where K is a normal cone (convex, pointed, solid), and K = {s : s, x 0, x K}. Main Assumptions: 1. x 0 int K, s 0 int K, y 0 H : Ax = b, s + A y 0 = c. 2. F P (x) is a ν FP -normal barrier for K (self-concordant, log-homogenerous: F P (τx) = F (x) ν FP ln τ, x int K) Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 3/28
4 Nonlinear Conic Optimization Problem Primal-Dual Problem: min x { c, x : Ax = b, x K}? = max s,y { b, y : s+a y = c, s K }, where K is a normal cone (convex, pointed, solid), and K = {s : s, x 0, x K}. Main Assumptions: 1. x 0 int K, s 0 int K, y 0 H : Ax = b, s + A y 0 = c. 2. F P (x) is a ν FP -normal barrier for K (self-concordant, log-homogenerous: F P (τx) = F (x) ν FP ln τ, x int K) 3. Important: we can compute the dual barrier F D (s) = FP def (s) = max[ s, x F P (x)] x Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 3/28
5 Examples Positive orthant K = {x R n : x 0} (= K ), F P (x) = n ln x (i), ν P = n. i=1 Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 4/28
6 Examples Positive orthant Lorentz cone K = {x R n : x 0} (= K ), F P (x) = n ln x (i), ν P = n. i=1 K = {(τ, x) R n+1 : τ x 2 } (= K ), F P (τ, x) = ln(τ 2 x 2 2 ), ν P = 2. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 4/28
7 Examples Positive orthant Lorentz cone K = {x R n : x 0} (= K ), F P (x) = n ln x (i), ν P = n. i=1 K = {(τ, x) R n+1 : τ x 2 } (= K ), F P (τ, x) = ln(τ 2 x 2 2 ), ν P = 2. Cone of positive-semidefinite matrices K = {X S n : X 0} (= K ), F P (X ) = ln det X, ν P = n. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 4/28
8 Symmetric primal-dual IPM (F D = F P ) Primal-dual central path: (x(t), s(t), y(t)) K K H: x(t) = arg min [t c, x + F P(x)], t > 0, Ax=b y(t) = arg max[t b, y F D (c A T y)]. y Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 5/28
9 Symmetric primal-dual IPM (F D = F P ) Primal-dual central path: (x(t), s(t), y(t)) K K H: x(t) = arg min [t c, x + F P(x)], t > 0, Ax=b y(t) = arg max[t b, y F D (c A T y)]. y Many important identities: Ax(t) = b, s(t) + A y(t) = c, s(t) = 1 t F P(x(t)), unbounded {}}{ x(t) = 1 t F D(s(t)), c, x(t) b, y(t) = 1 t ν F P, F P (x(t)) + F D (s(t)) = ν ν ln t. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 5/28
10 Symmetric primal-dual IPM (F D = F P ) Primal-dual central path: (x(t), s(t), y(t)) K K H: x(t) = arg min [t c, x + F P(x)], t > 0, Ax=b y(t) = arg max[t b, y F D (c A T y)]. y Many important identities: Ax(t) = b, s(t) + A y(t) = c, s(t) = 1 t F P(x(t)), unbounded {}}{ x(t) = 1 t F D(s(t)), c, x(t) b, y(t) = 1 t ν F P, F P (x(t)) + F D (s(t)) = ν ν ln t. Consequences: Good search directions (primal-dual affine-scaling, centering) Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 5/28
11 Symmetric primal-dual IPM (F D = F P ) Primal-dual central path: (x(t), s(t), y(t)) K K H: x(t) = arg min [t c, x + F P(x)], t > 0, Ax=b y(t) = arg max[t b, y F D (c A T y)]. y Many important identities: Ax(t) = b, s(t) + A y(t) = c, s(t) = 1 t F P(x(t)), unbounded {}}{ x(t) = 1 t F D(s(t)), c, x(t) b, y(t) = 1 t ν F P, F P (x(t)) + F D (s(t)) = ν ν ln t. Consequences: Good search directions (primal-dual affine-scaling, centering) Long-step IPM, infeasible-start IPM. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 5/28
12 Symmetric primal-dual IPM (F D = F P ) Primal-dual central path: (x(t), s(t), y(t)) K K H: x(t) = arg min [t c, x + F P(x)], t > 0, Ax=b y(t) = arg max[t b, y F D (c A T y)]. y Many important identities: Ax(t) = b, s(t) + A y(t) = c, s(t) = 1 t F P(x(t)), unbounded {}}{ x(t) = 1 t F D(s(t)), c, x(t) b, y(t) = 1 t ν F P, F P (x(t)) + F D (s(t)) = ν ν ln t. Consequences: Good search directions (primal-dual affine-scaling, centering) Long-step IPM, infeasible-start IPM. Powerful software (SeDuMi, T3, Mosek, etc.) Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 5/28
13 Another applications 1. Flows in fluid networks min c α f α γ (= Energy) f α A s.t. E f = d, (node balance) f i 0, i I. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 6/28
14 Another applications 1. Flows in fluid networks Electricity: γ = 2. min c α f α γ (= Energy) f α A s.t. E f = d, (node balance) f i 0, i I. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 6/28
15 Another applications 1. Flows in fluid networks min c α f α γ (= Energy) f α A s.t. E f = d, (node balance) f i 0, i I. Electricity: γ = 2. Gas networks: γ = 3. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 6/28
16 Another applications 1. Flows in fluid networks min c α f α γ (= Energy) f α A s.t. E f = d, (node balance) f i 0, i I. Electricity: γ = 2. Gas networks: γ = 3. Water: γ = Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 6/28
17 Another applications 1. Flows in fluid networks min c α f α γ (= Energy) f α A s.t. E f = d, (node balance) f i 0, i I. Electricity: γ = 2. Gas networks: γ = 3. Water: γ = Usually, the dimension is not too big! Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 6/28
18 Another applications 1. Flows in fluid networks min c α f α γ (= Energy) f α A s.t. E f = d, (node balance) f i 0, i I. Electricity: γ = 2. Gas networks: γ = 3. Water: γ = Usually, the dimension is not too big! 2. Random scheduling: minimize in x the objective T, x + n n i=1 j=i+1 ( d (i) d (j) ln e x(i) /d (i) + e x(j) /d (j)) D ē, x. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 6/28
19 Asymmetric barriers: 1. Power cone { K α = x R+ 2 R : ( x (1)) α ( x (2) ) 1 α x (3) }, α (0, 1), F P,α (x) = ln [ (x (1) ) 2α ( x (2) ) 2(1 α) ( x (3) ) 2 ] ln x (1) ln x (2), K α = { s R 2 + R : ( ) s (1) α ( ) s (2) 1 α α 1 α s } (3), F D,α (s) = ln with ν FP,α = ν FD,α = 4. K α = [ ( ) s (1) 2α ( ) s (2) 2(1 α) ( α 1 α s (3) ) 2] ln s (1) ln s (2), ( α α ) K α, but F D,α F P,α. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 7/28
20 Asymmetric barriers: 2. Conic hull of the epigraph of exponent { } K P,e = x R R+ 2 : x (1) x (2) ln x(2), x (3) ( ) F P,e (x) = ln x (1) x (2) ln x(2) ln x (2) ln x (3), x (3) K D,e = { } s R + R R + : s (1) + s (2) s (1) ln s(1), s (3) ( ) F D,e (x) = ln s (1) + s (2) s (1) ln s(1) ln s (1) ln s (3), s (3) with ν FP,e = ν FD,e = 3. K D,e = F D,e F P,e. ( ) K P,e, and Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 8/28
21 Asymmetric barrier for primal-dual cone Denote Define Ψ(z) Ψ(x, s) = F P (x) + F D (s), ν Ψ = ν FP + ν FD, z = (x, s) int K int K def = int K. κ(z 0 ) = Ψ(z 0 ) min x,s {Ψ(z) : s 0, x + s, x 0 = 2 s 0, x 0 }, where z 0 = (x 0, s 0 ) is the point from A1. Note that κ(z 0 ) 0. Lemma: For any z K we have Ψ(z) Ψ(z 0 ) κ(z 0 ) ν Ψ ln s 0,x + s,x 0 2 s 0,x 0. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 9/28
22 Feasible-start potential reduction IPM Primal-dual problem: w = (x, s, y, τ) K K H R + : Ax = τb, s + A y = τc, Normalization constraint: τ = 1. Optimal value of the objective: c, x b, y = 0. Karmarkar setting: For cone C with ν-normal barrier F (x), consider min{ d, w : Bw = 0, e, w = 1} = 0. w C Can be solved by minimizing homogeneous potential ν ln d, w + F (w). Condition: the set {w C : Bw = 0, e, w = 1} is bounded. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 10/28
23 Feasible-start potential reduction IPM Primal-dual problem: w = (x, s, y, τ) K K H R + : Ax = τb, s + A y = τc, Normalization constraint: τ = 1. Optimal value of the objective: c, x b, y = 0. Karmarkar setting: For cone C with ν-normal barrier F (x), consider min{ d, w : Bw = 0, e, w = 1} = 0. w C Can be solved by minimizing homogeneous potential ν ln d, w + F (w). Condition: the set {w C : Bw = 0, e, w = 1} is bounded. NOTE: the set {(x, s, y) K K H : Ax = b, s + A y = c} is never bounded Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 10/28
24 Feasible-start potential reduction IPM Denote F = {w = (x, s, y, τ) K K H R + : Ax = τb, s + A y = τc}, F (w) = F P (x) + F D (s) ln τ, ν F = ν P + ν D + 1, φ(w) = ν F ln[ c, x b, y ] + F (w), w int F. Main identity: for w F we have s 0, x + s, x 0 = c, x b, y + τ s 0, x 0. Theorem: Let w 0 (x 0, s 0, y 0, 1). If we form w k = (x k, s k, y k, τ k ) by minimizing φ(w) by the Newton method, then for the point we have x k = x k τ k, s k = s k τ k, ỹ k = y k τ k { } s 0,x 0 c, x k b,ỹ k 2 exp ω k κ(z0 ) ln 2 ν F 1. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 11/28
25 Feasible-start potential reduction IPM Advantages: Polynomial-time O(ν F ln 1 ɛ ) complexity bound. Asymmetric barrier F (w). Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 12/28
26 Feasible-start potential reduction IPM Advantages: Polynomial-time O(ν F ln 1 ɛ ) complexity bound. Asymmetric barrier F (w). Disadvantages: The worst-case complexity bound is not the best one. Feasible point is needed. Unavoidable expensive exact matrix operations. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 12/28
27 Full-dimensional potential reduction IPM Denote C {w = (x, s, y, τ) K K H R + }. By two positive-definite operators B H : H H, B E : E E, define the convex quadratic function Qw, w = Ax τb 2 B 1 H +[ c, x b, y ] 2 Optimal set: W = {w C : Qw = 0}. Main inequality: For any w C we have + s + A y τc 2 B 1 def = w 2 Q, E s 0, x + s, x 0 def = Ω {}}{ [1 + B H y 0, y 0 + B E x 0, x 0 ] 1/2 w Q +τ s 0, x 0, Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 13/28
28 Quadratic potential function Denote F (w) = Ψ(z) ln τ = F P (x) + F D (s) ln τ, Main properties Φ(w) = 1 2 w 2 Q + F (w), w int C. Φ(w) is a s.-c. function with positive definite Hessians. It is unbounded from below. Hence, the local norms of the gradients are all 1. For w int C, define homogeneous quadratic potential: Φ(w) = min Φ(λw) Φ(w). λ>0 The minimum is attained at λ = λ(w) def = ν1/2 F w Q. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 14/28
29 Properties of homogeneous potential It admits a closed-form representation: Φ(w) = ν F ln w Q + F (w) + ν F 2 [1 ln ν F ]. This is a quasi-convex function with zero degree of homogeneity. For any point w int C, we have Φ(w) Ψ(z 0 ) κ(z 0 ) + ν Ψ ln 2 + ν F 2 [1 ln ν F ] ν F ln ( Ω s 0,x 0 + τ w Q ). Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 15/28
30 Possible strategies A. Minimization of quadratic potential 1 Compute point w k by a Newton step from w k. 2 Define w k+1 = λ(w k ) w k. B. Minimization of homogeneous potential At each iteration, apply Newton step to an upper convex approximation of Φ. In both cases, Φ is decreased by an absolute constant (at least). Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 16/28
31 Possible strategies A. Minimization of quadratic potential 1 Compute point w k by a Newton step from w k. 2 Define w k+1 = λ(w k ) w k. B. Minimization of homogeneous potential At each iteration, apply Newton step to an upper convex approximation of Φ. In both cases, Φ is decreased by an absolute constant (at least). New even for LP! Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 16/28
32 Full-dimensional potential reduction IPM Advantages: Polynomial-time O(ν F ln 1 ɛ ) complexity bound. Asymmetric barrier F (w). Can start from infeasible points. Search directions may be computed by gradient schemes with reasonable accuracy. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 17/28
33 Full-dimensional potential reduction IPM Advantages: Polynomial-time O(ν F ln 1 ɛ ) complexity bound. Asymmetric barrier F (w). Can start from infeasible points. Search directions may be computed by gradient schemes with reasonable accuracy. Disadvantages: The worst-case complexity bound is not the best one. However, the long steps can accelerate the convergence. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 17/28
34 Central path for infeasible-start IPM Denote v = (x, s, τ) Ĉ def = K K R +, and ˆQv, v y(v) def = min{ Qw, w : w = (x, s, y, τ)}, def y = arg min{ Qw, w : w = (x, s, y, τ)}, y ˆF (v) = F P (x) + F D (s) ln τ, v Ĉ, νˆf = ν F, Φ(v) = 1 2 v 2ˆQ + ˆF (v), v int Ĉ. Ĉ is normal 2 ˆF ( ) 0. Central path: fix v 1 int Ĉ with λ(v 1) = 1. Define the central path v(µ) as µ 0: Φ(v(µ)) ˆQv(µ) + ˆF (v(µ)) = µ[ ˆQv 1 + ˆF (v 1 )] def = µg 1. Clearly, v(1) = v 1. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 18/28
35 Properties of the central path v(µ) ˆQ ν 1/2 F, µ (0, 1]. Denote V = {v Ĉ : ˆQv = 0}. For any v V we have µ ˆF (v 1 ), v = ˆF (v(µ)), v 2 ˆF (v(µ))v, v 1/2. If v = (x, s, 1) V, then s 0,x 0 µ ˆF (v 1 ),v s 0, x(µ) + s(µ), x 0. Since s 0, x + s, x 0 Ω v ˆQ + τ s 0, x 0, we get Lemma: For any µ (0, 1] τ(µ) v(µ) ˆQ 1 Ω ν 1/2 F ˆF (v 1 ),v µ s 0,x 0. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 19/28
36 Augmented self-concordant barriers (N. & Vial 2004) Denote ψ µ (v) = Φ(v) µ g 1, w. For v int Ĉ, consider two local metrics: σ v (g) = 2 ˆF (v)[ 2 Φ(v)] 1 g, [ 2 Φ(v)] 1 g, θ v (g) = g, [ 2 ˆF (v)] 1 g 1/2. (Simple to compute!) Properties: σ v (g) θ v (g). For all v int Ĉ, σ v ( Φ(v)) ν 1/2 F. For the Newton iterate v + = v [ 2 ψ µ (v)] 1 ψ µ (v), we have ( θv σ + ( ψ µ (v + ))) v ( ψ 2 µ(v)) 1 σv ( ψ µ(v))). Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 20/28
37 Predictor-corrector technique Neighborhood of the Central Path: N β (µ) = {v : θ v ( ψ µ (v)) β}, [ µ (0, 1], β 0, ). Predictor step T v (α) = v [ 2 Φ(v)] 1 ψ µ (v) }{{} v(µ) α [ 2 Φ(v)] 1 g }{{} 1, α 0. v (µ) Goal: for v N β0 (µ) with β 0 β 1, choose the maximal α: T v (α) N β1 (µ α). Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 21/28
38 Predictor-corrector technique Neighborhood of the Central Path: N β (µ) = {v : θ v ( ψ µ (v)) β}, [ µ (0, 1], β 0, ). Predictor step T v (α) = v [ 2 Φ(v)] 1 ψ µ (v) }{{} v(µ) α [ 2 Φ(v)] 1 g }{{} 1, α 0. v (µ) Goal: for v N β0 (µ) with β 0 β 1, choose the maximal α: T v (α) N β1 (µ α). Theorem: for v N β0 (µ), and α 0 satisfying β 0 + α µ (β 0 + σv ( Φ(v))) we have T v (α) N β1 (µ α). β1 1+ β 1, Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 21/28
39 Possible path-following strategies 1 Lazy scheme. β 1 = β 0. Efficiency estimate : α k 5 µ k ν 1/2 F (β 0 = 1 9 ). Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 22/28
40 Possible path-following strategies 1 Lazy scheme. β 1 = β 0. Efficiency estimate : α k 5 µ k ν 1/2 F (β 0 = 1 9 ). 2 Real predictor-corrector. Note that θ T vk (α k ) ( ψ µ k α k (T vk (α k ))) [ ] β0 2 (1 β 0 + 2β ) 2 0 (1 β 0 β ) σv k ( Φ(v k )) αk µ k + O ( α 2 k µ 2 k ). Thus, it is better to keep β 0 small with respect to β 1. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 22/28
41 Computational aspects 1. Path-following scheme. The measure θ v ( ψ µ (v)) = ψ µ (v), [ 2 ˆF (v)] 1 ψ µ (v) 1/2 is easy to compute. Examples. a) LP. For positive orthant θ v (g) = [ n i=1 ] ( 1/2 g (i) v (i)) 2. b) Separable cones. Direct product of many cones of small dimension. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 23/28
42 Computational aspects 2. Potential-reduction scheme. For homogeneous quadratic potential Φ(w) = ν F ln w Q + F (w) + ν F 2 [1 ln ν F ], we have an upper bound Φ(w + h) Φ(w) ν F 2 Qw,h + Qh,h 2 Qw,w Hence, for the Newton step we need to minimize ν F 2 Qw,h + Qh,h 2 Qw,w + F (w + h) F (w). + F (w), h + 2 F (w)h, h. Note: We need to achieve a constant drop (by CG?). Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 24/28
43 Computational aspects Main competitors: Fast gradient schemes for solving the problem Note: min{ Qw, w : τ = 1, w F}. w The memory requirements are the same. One iteration of CG for potential-reduction methods has the same complexity as one iteration of GM. Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 25/28
44 n m LP Lorentz K 1 2 K 1 3 K exp Table: Performance of long-step PF-method Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 26/28
45 Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 27/28
46 Potential-reduction scheme for LP n m Iterations Average Φ Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 28/28
Nonsymmetric potential-reduction methods for general cones
CORE DISCUSSION PAPER 2006/34 Nonsymmetric potential-reduction methods for general cones Yu. Nesterov March 28, 2006 Abstract In this paper we propose two new nonsymmetric primal-dual potential-reduction
More informationConstructing self-concordant barriers for convex cones
CORE DISCUSSION PAPER 2006/30 Constructing self-concordant barriers for convex cones Yu. Nesterov March 21, 2006 Abstract In this paper we develop a technique for constructing self-concordant barriers
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 informationA full-newton step infeasible interior-point algorithm for linear programming based on a kernel function
A full-newton step infeasible interior-point algorithm for linear programming based on a kernel function Zhongyi Liu, Wenyu Sun Abstract This paper proposes an infeasible interior-point algorithm with
More 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 information12. Interior-point methods
12. Interior-point methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
More informationLecture 17: Primal-dual interior-point methods part II
10-725/36-725: Convex Optimization Spring 2015 Lecture 17: Primal-dual interior-point methods part II Lecturer: Javier Pena Scribes: Pinchao Zhang, Wei Ma Note: LaTeX template courtesy of UC Berkeley EECS
More informationPRIMAL-DUAL INTERIOR-POINT METHODS FOR SELF-SCALED CONES
PRIMAL-DUAL INTERIOR-POINT METHODS FOR SELF-SCALED CONES YU. E. NESTEROV AND M. J. TODD Abstract. In this paper we continue the development of a theoretical foundation for efficient primal-dual interior-point
More informationAugmented self-concordant barriers and nonlinear optimization problems with finite complexity
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity Yu. Nesterov J.-Ph. Vial October 9, 2000 Abstract In this paper we study special barrier functions for the
More informationLecture 10. Primal-Dual Interior Point Method for LP
IE 8534 1 Lecture 10. Primal-Dual Interior Point Method for LP IE 8534 2 Consider a linear program (P ) minimize c T x subject to Ax = b x 0 and its dual (D) maximize b T y subject to A T y + s = c s 0.
More informationLecture 3: Huge-scale optimization problems
Liege University: Francqui Chair 2011-2012 Lecture 3: Huge-scale optimization problems Yurii Nesterov, CORE/INMA (UCL) March 9, 2012 Yu. Nesterov () Huge-scale optimization problems 1/32March 9, 2012 1
More informationOn self-concordant barriers for generalized power cones
On self-concordant barriers for generalized power cones Scott Roy Lin Xiao January 30, 2018 Abstract In the study of interior-point methods for nonsymmetric conic optimization and their applications, Nesterov
More informationSemidefinite Programming
Chapter 2 Semidefinite Programming 2.0.1 Semi-definite programming (SDP) Given C M n, A i M n, i = 1, 2,..., m, and b R m, the semi-definite programming problem is to find a matrix X M n for the optimization
More informationLECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE
LECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE CONVEX ANALYSIS AND DUALITY Basic concepts of convex analysis Basic concepts of convex optimization Geometric duality framework - MC/MC Constrained optimization
More informationA polynomial-time interior-point method for conic optimization, with inexact barrier evaluations
A polynomial-time interior-point method for conic optimization, with inexact barrier evaluations Simon P. Schurr Dianne P. O Leary André L. Tits Technical Report University of Maryland March 9, 2008 Abstract
More informationLocal Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolic Cone Optimization Problems
Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolic Cone Optimization Problems Yu. Nesterov and L. Tunçel November 009, revised: December 04 Abstract In this paper, we
More informationFull Newton step polynomial time methods for LO based on locally self concordant barrier functions
Full Newton step polynomial time methods for LO based on locally self concordant barrier functions (work in progress) Kees Roos and Hossein Mansouri e-mail: [C.Roos,H.Mansouri]@ewi.tudelft.nl URL: http://www.isa.ewi.tudelft.nl/
More informationLecture 6: Conic Optimization September 8
IE 598: Big Data Optimization Fall 2016 Lecture 6: Conic Optimization September 8 Lecturer: Niao He Scriber: Juan Xu Overview In this lecture, we finish up our previous discussion on optimality conditions
More informationPrimal-Dual Symmetric Interior-Point Methods from SDP to Hyperbolic Cone Programming and Beyond
Primal-Dual Symmetric Interior-Point Methods from SDP to Hyperbolic Cone Programming and Beyond Tor Myklebust Levent Tunçel September 26, 2014 Convex Optimization in Conic Form (P) inf c, x A(x) = b, x
More informationLecture 9 Sequential unconstrained minimization
S. Boyd EE364 Lecture 9 Sequential unconstrained minimization brief history of SUMT & IP methods logarithmic barrier function central path UMT & SUMT complexity analysis feasibility phase generalized inequalities
More informationPrimal-Dual Interior-Point Methods for Linear Programming based on Newton s Method
Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method Robert M. Freund March, 2004 2004 Massachusetts Institute of Technology. The Problem The logarithmic barrier approach
More informationInterior Point Methods for Mathematical Programming
Interior Point Methods for Mathematical Programming Clóvis C. Gonzaga Federal University of Santa Catarina, Florianópolis, Brazil EURO - 2013 Roma Our heroes Cauchy Newton Lagrange Early results Unconstrained
More informationSecond-order cone programming
Outline Second-order cone programming, PhD Lehigh University Department of Industrial and Systems Engineering February 10, 2009 Outline 1 Basic properties Spectral decomposition The cone of squares The
More informationInterior Point Methods in Mathematical Programming
Interior Point Methods in Mathematical Programming Clóvis C. Gonzaga Federal University of Santa Catarina, Brazil Journées en l honneur de Pierre Huard Paris, novembre 2008 01 00 11 00 000 000 000 000
More informationA FULL-NEWTON STEP INFEASIBLE-INTERIOR-POINT ALGORITHM COMPLEMENTARITY PROBLEMS
Yugoslav Journal of Operations Research 25 (205), Number, 57 72 DOI: 0.2298/YJOR3055034A A FULL-NEWTON STEP INFEASIBLE-INTERIOR-POINT ALGORITHM FOR P (κ)-horizontal LINEAR COMPLEMENTARITY PROBLEMS Soodabeh
More informationA path following interior-point algorithm for semidefinite optimization problem based on new kernel function. djeffal
Journal of Mathematical Modeling Vol. 4, No., 206, pp. 35-58 JMM A path following interior-point algorithm for semidefinite optimization problem based on new kernel function El Amir Djeffal a and Lakhdar
More informationA polynomial-time interior-point method for conic optimization, with inexact barrier evaluations
A polynomial-time interior-point method for conic optimization, with inexact barrier evaluations Simon P. Schurr Dianne P. O Leary André L. Tits University of Maryland Technical Report CS-TR-492 & UMIACS-TR-2008-0
More informationLargest dual ellipsoids inscribed in dual cones
Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that
More informationIMPLEMENTATION OF INTERIOR POINT METHODS
IMPLEMENTATION OF INTERIOR POINT METHODS IMPLEMENTATION OF INTERIOR POINT METHODS FOR SECOND ORDER CONIC OPTIMIZATION By Bixiang Wang, Ph.D. A Thesis Submitted to the School of Graduate Studies in Partial
More informationA tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes
A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes Murat Mut Tamás Terlaky Department of Industrial and Systems Engineering Lehigh University
More informationIntroduction 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 informationA Second-Order Path-Following Algorithm for Unconstrained Convex Optimization
A Second-Order Path-Following Algorithm for Unconstrained Convex Optimization Yinyu Ye Department is Management Science & Engineering and Institute of Computational & Mathematical Engineering Stanford
More informationInterior Point Methods. We ll discuss linear programming first, followed by three nonlinear problems. Algorithms for Linear Programming Problems
AMSC 607 / CMSC 764 Advanced Numerical Optimization Fall 2008 UNIT 3: Constrained Optimization PART 4: Introduction to Interior Point Methods Dianne P. O Leary c 2008 Interior Point Methods We ll discuss
More information4TE3/6TE3. Algorithms for. Continuous Optimization
4TE3/6TE3 Algorithms for Continuous Optimization (Algorithms for Constrained Nonlinear Optimization Problems) Tamás TERLAKY Computing and Software McMaster University Hamilton, November 2005 terlaky@mcmaster.ca
More 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 informationInterior Point Methods for Nonlinear Optimization
Interior Point Methods for Nonlinear Optimization Imre Pólik 1 and Tamás Terlaky 2 1 School of Computational Engineering and Science, McMaster University, Hamilton, Ontario, Canada, imre@polik.net 2 School
More informationSubgradient methods for huge-scale optimization problems
Subgradient methods for huge-scale optimization problems Yurii Nesterov, CORE/INMA (UCL) May 24, 2012 (Edinburgh, Scotland) Yu. Nesterov Subgradient methods for huge-scale problems 1/24 Outline 1 Problems
More informationInterior Point Methods for Convex Quadratic and Convex Nonlinear Programming
School of Mathematics T H E U N I V E R S I T Y O H F E D I N B U R G Interior Point Methods for Convex Quadratic and Convex Nonlinear Programming Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio
More informationOn Conically Ordered Convex Programs
On Conically Ordered Convex Programs Shuzhong Zhang May 003; revised December 004 Abstract In this paper we study a special class of convex optimization problems called conically ordered convex programs
More informationA Generalized Homogeneous and Self-Dual Algorithm. for Linear Programming. February 1994 (revised December 1994)
A Generalized Homogeneous and Self-Dual Algorithm for Linear Programming Xiaojie Xu Yinyu Ye y February 994 (revised December 994) Abstract: A generalized homogeneous and self-dual (HSD) infeasible-interior-point
More informationNew stopping criteria for detecting infeasibility in conic optimization
Optimization Letters manuscript No. (will be inserted by the editor) New stopping criteria for detecting infeasibility in conic optimization Imre Pólik Tamás Terlaky Received: March 21, 2008/ Accepted:
More information15. Conic optimization
L. Vandenberghe EE236C (Spring 216) 15. Conic optimization conic linear program examples modeling duality 15-1 Generalized (conic) inequalities Conic inequality: a constraint x K where K is a convex cone
More informationInterior-Point Methods for Linear Optimization
Interior-Point Methods for Linear Optimization Robert M. Freund and Jorge Vera March, 204 c 204 Robert M. Freund and Jorge Vera. All rights reserved. Linear Optimization with a Logarithmic Barrier Function
More informationSupplement: Universal Self-Concordant Barrier Functions
IE 8534 1 Supplement: Universal Self-Concordant Barrier Functions IE 8534 2 Recall that a self-concordant barrier function for K is a barrier function satisfying 3 F (x)[h, h, h] 2( 2 F (x)[h, h]) 3/2,
More informationComplexity bounds for primal-dual methods minimizing the model of objective function
Complexity bounds for primal-dual methods minimizing the model of objective function Yu. Nesterov July 4, 06 Abstract We provide Frank-Wolfe ( Conditional Gradients method with a convergence analysis allowing
More informationAgenda. Interior Point Methods. 1 Barrier functions. 2 Analytic center. 3 Central path. 4 Barrier method. 5 Primal-dual path following algorithms
Agenda Interior Point Methods 1 Barrier functions 2 Analytic center 3 Central path 4 Barrier method 5 Primal-dual path following algorithms 6 Nesterov Todd scaling 7 Complexity analysis Interior point
More informationEnlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions Y B Zhao Abstract It is well known that a wide-neighborhood interior-point algorithm
More informationL. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones. definition. spectral decomposition. quadratic representation. log-det barrier 18-1
L. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones definition spectral decomposition quadratic representation log-det barrier 18-1 Introduction This lecture: theoretical properties of the following
More informationE5295/5B5749 Convex optimization with engineering applications. Lecture 8. Smooth convex unconstrained and equality-constrained minimization
E5295/5B5749 Convex optimization with engineering applications Lecture 8 Smooth convex unconstrained and equality-constrained minimization A. Forsgren, KTH 1 Lecture 8 Convex optimization 2006/2007 Unconstrained
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 informationFast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma
Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 8 September 2003 European Union RTN Summer School on Multi-Agent
More informationGradient methods for minimizing composite functions
Gradient methods for minimizing composite functions Yu. Nesterov May 00 Abstract In this paper we analyze several new methods for solving optimization problems with the objective function formed as a sum
More informationSVM May 2007 DOE-PI Dianne P. O Leary c 2007
SVM May 2007 DOE-PI Dianne P. O Leary c 2007 1 Speeding the Training of Support Vector Machines and Solution of Quadratic Programs Dianne P. O Leary Computer Science Dept. and Institute for Advanced Computer
More informationInterior-Point Methods
Interior-Point Methods Stephen Wright University of Wisconsin-Madison Simons, Berkeley, August, 2017 Wright (UW-Madison) Interior-Point Methods August 2017 1 / 48 Outline Introduction: Problems and Fundamentals
More informationA full-newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function
Algorithmic Operations Research Vol7 03) 03 0 A full-newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function B Kheirfam a a Department of Mathematics,
More informationA Homogeneous Interior-Point Algorithm for Nonsymmetric Convex Conic Optimization
Mathematical Programming manuscript No. (will be inserted by the editor) A Homogeneous Interior-Point Algorithm for Nonsymmetric Convex Conic Optimization Anders Skajaa Yinyu Ye Received: date / Accepted:
More informationWhat can be expressed via Conic Quadratic and Semidefinite Programming?
What can be expressed via Conic Quadratic and Semidefinite Programming? A. Nemirovski Faculty of Industrial Engineering and Management Technion Israel Institute of Technology Abstract Tremendous recent
More informationLINEAR AND NONLINEAR PROGRAMMING
LINEAR AND NONLINEAR PROGRAMMING Stephen G. Nash and Ariela Sofer George Mason University The McGraw-Hill Companies, Inc. New York St. Louis San Francisco Auckland Bogota Caracas Lisbon London Madrid Mexico
More informationCubic regularization of Newton s method for convex problems with constraints
CORE DISCUSSION PAPER 006/39 Cubic regularization of Newton s method for convex problems with constraints Yu. Nesterov March 31, 006 Abstract In this paper we derive efficiency estimates of the regularized
More information10 Numerical methods for constrained problems
10 Numerical methods for constrained problems min s.t. f(x) h(x) = 0 (l), g(x) 0 (m), x X The algorithms can be roughly divided the following way: ˆ primal methods: find descent direction keeping inside
More informationA new primal-dual path-following method for convex quadratic programming
Volume 5, N., pp. 97 0, 006 Copyright 006 SBMAC ISSN 00-805 www.scielo.br/cam A new primal-dual path-following method for convex quadratic programming MOHAMED ACHACHE Département de Mathématiques, Faculté
More informationAn Infeasible Interior-Point Algorithm with full-newton Step for Linear Optimization
An Infeasible Interior-Point Algorithm with full-newton Step for Linear Optimization H. Mansouri M. Zangiabadi Y. Bai C. Roos Department of Mathematical Science, Shahrekord University, P.O. Box 115, Shahrekord,
More information18. Primal-dual interior-point methods
L. Vandenberghe EE236C (Spring 213-14) 18. Primal-dual interior-point methods primal-dual central path equations infeasible primal-dual method primal-dual method for self-dual embedding 18-1 Symmetric
More informationLecture 5. Theorems of Alternatives and Self-Dual Embedding
IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c
More informationCS711008Z Algorithm Design and Analysis
CS711008Z Algorithm Design and Analysis Lecture 8 Linear programming: interior point method Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 31 Outline Brief
More informationNonlinear 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 informationResearch Note. A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization
Iranian Journal of Operations Research Vol. 4, No. 1, 2013, pp. 88-107 Research Note A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization B. Kheirfam We
More information10-725/ Optimization Midterm Exam
10-725/36-725 Optimization Midterm Exam November 6, 2012 NAME: ANDREW ID: Instructions: This exam is 1hr 20mins long Except for a single two-sided sheet of notes, no other material or discussion is permitted
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 informationPrimal-Dual Geometry of Level Sets and their Explanatory Value of the Practical Performance of Interior-Point Methods for Conic Optimization
Primal-Dual Geometry of Level Sets and their Explanatory Value of the Practical Performance of Interior-Point Methods for Conic Optimization Robert M. Freund M.I.T. June, 2010 from papers in SIOPT, Mathematics
More informationApolynomialtimeinteriorpointmethodforproblemswith nonconvex constraints
Apolynomialtimeinteriorpointmethodforproblemswith nonconvex constraints Oliver Hinder, Yinyu Ye Department of Management Science and Engineering Stanford University June 28, 2018 The problem I Consider
More informationA PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE
Yugoslav Journal of Operations Research 24 (2014) Number 1, 35-51 DOI: 10.2298/YJOR120904016K A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE BEHROUZ
More informationLECTURE 13 LECTURE OUTLINE
LECTURE 13 LECTURE OUTLINE Problem Structures Separable problems Integer/discrete problems Branch-and-bound Large sum problems Problems with many constraints Conic Programming Second Order Cone Programming
More information12. Interior-point methods
12. Interior-point methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
More informationA homogeneous interior-point algorithm for nonsymmetric convex conic optimization
Downloaded from orbit.dtu.dk on: Dec 15, 2017 A homogeneous interior-point algorithm for nonsymmetric convex conic optimization Skajaa, Anders; Ye, Yinyu Published in: Mathematical Programming Link to
More information2.098/6.255/ Optimization Methods Practice True/False Questions
2.098/6.255/15.093 Optimization Methods Practice True/False Questions December 11, 2009 Part I For each one of the statements below, state whether it is true or false. Include a 1-3 line supporting sentence
More informationChapter 6 Interior-Point Approach to Linear Programming
Chapter 6 Interior-Point Approach to Linear Programming Objectives: Introduce Basic Ideas of Interior-Point Methods. Motivate further research and applications. Slide#1 Linear Programming Problem Minimize
More 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 informationA Second Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
A Second Full-Newton Step On Infeasible Interior-Point Algorithm for Linear Optimization H. Mansouri C. Roos August 1, 005 July 1, 005 Department of Electrical Engineering, Mathematics and Computer Science,
More informationADVANCES IN CONVEX OPTIMIZATION: CONIC PROGRAMMING. Arkadi Nemirovski
ADVANCES IN CONVEX OPTIMIZATION: CONIC PROGRAMMING Arkadi Nemirovski Georgia Institute of Technology and Technion Israel Institute of Technology Convex Programming solvable case in Optimization Revealing
More informationConvex optimization. Javier Peña Carnegie Mellon University. Universidad de los Andes Bogotá, Colombia September 2014
Convex optimization Javier Peña Carnegie Mellon University Universidad de los Andes Bogotá, Colombia September 2014 1 / 41 Convex optimization Problem of the form where Q R n convex set: min x f(x) x Q,
More informationPrimal-Dual Interior-Point Methods. Javier Peña Convex Optimization /36-725
Primal-Dual Interior-Point Methods Javier Peña Convex Optimization 10-725/36-725 Last time: duality revisited Consider the problem min x subject to f(x) Ax = b h(x) 0 Lagrangian L(x, u, v) = f(x) + u T
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
More informationInterior Point Methods: Second-Order Cone Programming and Semidefinite Programming
School of Mathematics T H E U N I V E R S I T Y O H F E D I N B U R G Interior Point Methods: Second-Order Cone Programming and Semidefinite Programming Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio
More informationAccelerating the cubic regularization of Newton s method on convex problems
Accelerating the cubic regularization of Newton s method on convex problems Yu. Nesterov September 005 Abstract In this paper we propose an accelerated version of the cubic regularization of Newton s method
More informationLagrangian Duality Theory
Lagrangian Duality Theory Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye Chapter 14.1-4 1 Recall Primal and Dual
More information1. Gradient method. gradient method, first-order methods. quadratic bounds on convex functions. analysis of gradient method
L. Vandenberghe EE236C (Spring 2016) 1. Gradient method gradient method, first-order methods quadratic bounds on convex functions analysis of gradient method 1-1 Approximate course outline First-order
More informationOptimization: Then and Now
Optimization: Then and Now Optimization: Then and Now Optimization: Then and Now Why would a dynamicist be interested in linear programming? Linear Programming (LP) max c T x s.t. Ax b αi T x b i for i
More informationminimize x subject to (x 2)(x 4) u,
Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for
More informationSEMIDEFINITE PROGRAM BASICS. Contents
SEMIDEFINITE PROGRAM BASICS BRIAN AXELROD Abstract. A introduction to the basics of Semidefinite programs. Contents 1. Definitions and Preliminaries 1 1.1. Linear Algebra 1 1.2. Convex Analysis (on R n
More informationLocal Self-concordance of Barrier Functions Based on Kernel-functions
Iranian Journal of Operations Research Vol. 3, No. 2, 2012, pp. 1-23 Local Self-concordance of Barrier Functions Based on Kernel-functions Y.Q. Bai 1, G. Lesaja 2, H. Mansouri 3, C. Roos *,4, M. Zangiabadi
More informationA New Class of Polynomial Primal-Dual Methods for Linear and Semidefinite Optimization
A New Class of Polynomial Primal-Dual Methods for Linear and Semidefinite Optimization Jiming Peng Cornelis Roos Tamás Terlaky August 8, 000 Faculty of Information Technology and Systems, Delft University
More informationPrimal Central Paths and Riemannian Distances for Convex Sets
«FOCM 128 layout: Small Extended v.1.2 reference style: focm file: focm919.tex (Michail) aid: 919 doctopic: OriginalPaper class: spr-small-v1.1 v.27/11/26 Prn:5/12/27; 11:4 p. 1» 1 2 3 4 5 6 7 8 9 1 11
More informationOptimization. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30
Optimization Escuela de Ingeniería Informática de Oviedo (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30 Unconstrained optimization Outline 1 Unconstrained optimization 2 Constrained
More informationA New Self-Dual Embedding Method for Convex Programming
A New Self-Dual Embedding Method for Convex Programming Shuzhong Zhang October 2001; revised October 2002 Abstract In this paper we introduce a conic optimization formulation to solve constrained convex
More informationNonlinear Programming Models
Nonlinear Programming Models Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Nonlinear Programming Models p. Introduction Nonlinear Programming Models p. NLP problems minf(x) x S R n Standard form:
More informationA Full Newton Step Infeasible Interior Point Algorithm for Linear Optimization
A Full Newton Step Infeasible Interior Point Algorithm for Linear Optimization Kees Roos e-mail: C.Roos@tudelft.nl URL: http://www.isa.ewi.tudelft.nl/ roos 37th Annual Iranian Mathematics Conference Tabriz,
More informationInterior Point Algorithms for Constrained Convex Optimization
Interior Point Algorithms for Constrained Convex Optimization Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Inequality constrained minimization problems
More informationLecture 8 Plus properties, merit functions and gap functions. September 28, 2008
Lecture 8 Plus properties, merit functions and gap functions September 28, 2008 Outline Plus-properties and F-uniqueness Equation reformulations of VI/CPs Merit functions Gap merit functions FP-I book:
More informationConic Linear Programming. Yinyu Ye
Conic Linear Programming Yinyu Ye December 2004, revised October 2017 i ii Preface This monograph is developed for MS&E 314, Conic Linear Programming, which I am teaching at Stanford. Information, lecture
More information