Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

We consider solving the unconstrained optimization problem

minimizef(x)subject toxRn\begin{array}{ll} \minimize &\quad f(x)\\ \st& \quad x \in \mathbb{R}^n \end{array}

through Newton’s method with unit step size

x(k+1)=x(k)[2f(x(k))]1f(x(k)),k=0,1,2,x^{(k+1)} = x^{(k)} - \left[\nabla^2 f(x^{(k)})\right]^{-1} \nabla f(x^{(k)}), \quad k=0, 1, 2, \ldots

basic assumptions

The content of this section has been adapted from Nocedal & Wright (2006).

Main result

Comments

References
  1. Nocedal, J., & Wright, S. J. (2006). Numerical optimization (Second Edition). Springer.