Abstract
In this note we discuss the convergence of Newton’s method for minimization. We present examples in which the Newton iterates satisfy the Wolfe conditions and the Hessian is positive definite at each step and yet the iterates converge to a non-stationary point. These examples answer a question posed by Fletcher in his 1987 book Practical methods of optimization.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Byrd R., Marazzi M., Nocedal J. (2004) On the convergence of Newton iterations to non-stationary points. Math. Program. 99, 127–148
Fletcher R. (1987) Practical Methods of Optimization, 2nd edn. Wiley, Chichester
Mascarenhas W.F. (2004) The BFGS method with exact line searches fails for non-convex objective functions. Math. Program. 99, 49–61
Mascarenhas, W.F.: On the divergence of line search methods. J. Comput. Appl. Math. Preliminary version available online at www.ime.usp.br/~walterfm/pub/divergence.pdf (submitted)
Powell M.J.D. (1970) A hybrid method for nonlinear equations. In: Rabinowitz P. (eds). Numerical Methods for Nonlinear Algebraic Equations. Gordon and Breach, London, pp. 87–114
Powell M.J.D. (2000) On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables. Math. Program. Ser. B 87, 281–301
Nesterov Y., Polyak B. (2006) A cubic regularization of a Newton scheme and its global performance. Math. Program. 108, 177–205
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mascarenhas, W.F. Newton’s iterates can converge to non-stationary points. Math. Program. 112, 327–334 (2008). https://doi.org/10.1007/s10107-006-0019-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-006-0019-y