Newton's iterates can converge to non-stationary points

DOI10.1007/S10107-006-0019-YMaRDI QIDQ2465652zbMATH OpenOpenAlexFDO

Authors Walter F. Mascarenhas

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

Mathematics Subject Classification ID

Methods of quasi-Newton type (90C53)

Recommendations

• On the convergence of Newton iterations to non-stationary points
• A Newton’s iteration converges quadratically to nonisolated solutions too
• On the convergence of the Newton iteration
• The convergence of iterations based on a continuous analogue of Newton's method
• scientific article; zbMATH DE number 2073957
• Convergence of Newton-like-iterative methods
• Convergence of a Newton-like \(S\)-iteration process in \(\mathbb R\)
• scientific article; zbMATH DE number 3057607
• On the convergence of Newton's method
• scientific article; zbMATH DE number 702134

Cites work

• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• Cubic regularization of Newton method and its global performance
• 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
• The BFGS method with exact line searches fails for non-convex objective functions

Cited in

(12)

• The divergence of the BFGS and Gauss Newton methods
• Newton's method may fail to recognize proximity to optimal points in constrained optimization
• No Fooling! Newton's Method Can Be Fooled
• A simple canonical form for nonlinear programming problems and its use
• On the convergence of Newton iterations to non-stationary points
• 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
• Minimizing sequences in a constrained DC optimization problem
• Step response-based identification of fractional order time delay models
• Sometimes Newton's Method Always Cycles
• The divergence of the barycentric Padé interpolants
• A local search method for optimization problem with d.c. inequality constraints

This page was built for publication: Newton's iterates can converge to non-stationary points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465652)