Convex Optimization · Problem 9.12

Equality constrained minimization — Boyd & Vandenberghe

Mathematics — Optimization · trust-region-newton-method

Problem

Trust region Newton method. If ∇2f(x)\nabla^2 f(x) is singular (or very ill-conditioned), the Newton step Δxnt=−∇2f(x)−1∇f(x)\Delta x_{\mathrm{nt}} = -\nabla^2 f(x)^{-1} \nabla f(x) is not well defined. Instead we can define a search direction Δxtr\Delta x_{\mathrm{tr}} as the solution of minimize(1/2)vTHv+gTvsubject to∥v∥2≤γ,\begin{array}{ll} \text{minimize} & (1/2)v^T H v + g^T v \\ \text{subject to} & \|v\|_2 \leq \gamma, \end{array} where H=∇2f(x)H = \nabla^2 f(x), g=∇f(x)g = \nabla f(x), and γ\gamma is a positive constant. The point x+Δxtrx + \Delta x_{\mathrm{tr}} minimizes the second-order approximation of ff at xx, subject to the constraint that ∥(x+Δxtr)−x∥2≤γ\|(x + \Delta x_{\mathrm{tr}}) - x\|_2 \leq \gamma. The set {v∣∥v∥2≤γ}\{v \mid \|v\|_2 \leq \gamma\} is called the trust region. The parameter γ\gamma, the size of the trust region, reflects our confidence in the second-order model. Show that Δxtr\Delta x_{\mathrm{tr}} minimizes (1/2)vTHv+gTv+β^∥v∥22,(1/2)v^T H v + g^T v + \hat{\beta}\|v\|_2^2, for some β^\hat{\beta}. This quadratic function can be interpreted as a regularized quadratic model for ff around xx.

Related theory

Browse the problem library