Convex Optimization · Problem 9.18

Equality constrained minimization — Boyd & Vandenberghe

Mathematics — Optimization · quadratic-convergence-self-concordant

Problem

Quadratic convergence. Let f:Rn→Rf : \mathbf{R}^n \to \mathbf{R} be a strictly convex self-concordant function. Suppose λ(x)<1\lambda(x) < 1, and define x+=x−∇2f(x)−1∇f(x)x^+ = x - \nabla^2 f(x)^{-1} \nabla f(x). Prove that λ(x+)≤λ(x)2/(1−λ(x))2\lambda(x^+) \leq \lambda(x)^2 / (1 - \lambda(x))^2. Hint. Use the inequalities in exercise 9.17, part (c).

Related theory

Browse the problem library