Newton's iterates can converge to non-stationary points
From MaRDI portal
Publication:2465652
DOI10.1007/s10107-006-0019-yzbMath1144.90512OpenAlexW2056927789MaRDI QIDQ2465652
Publication date: 7 January 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0019-y
Related Items (8)
Simple examples for the failure of Newton's method with line search for strictly convex minimization ⋮ On Newton's method for the Fermat-Weber location problem ⋮ A simple canonical form for nonlinear programming problems and its use ⋮ Step response-based identification of fractional order time delay models ⋮ Minimizing sequences in a constrained DC optimization problem ⋮ The divergence of the BFGS and Gauss Newton methods ⋮ A local search method for optimization problem with d.c. inequality constraints ⋮ The divergence of the barycentric Padé interpolants
Cites Work
- Unnamed Item
- The BFGS method with exact line searches fails for non-convex objective functions
- On the convergence of Newton iterations to non-stationary points
- On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables
- Cubic regularization of Newton method and its global performance
This page was built for publication: Newton's iterates can converge to non-stationary points
