On the convergence of Newton iterations to non-stationary points

DOI10.1007/S10107-003-0376-8zbMath1072.90038OpenAlexW2058194880MaRDI QIDQ1424291

Marcelo Marazzi, Byrd, Richard H., Nocedal, Jorge

Publication date: 11 March 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0376-8

zbMATH Keywords

Newton methodsingular non-stationary pointsstep length selection

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Interior-point methods (90C51) Methods of successive quadratic programming type (90C55)

Related Items (27)

On local search in d.c. optimization problems ⋮ Simple examples for the failure of Newton's method with line search for strictly convex minimization ⋮ Inner solvers for interior point methods for large scale nonlinear programming ⋮ A lower-bound formulation for the geometry and topology optimization of truss structures under multiple loading ⋮ An improved line search filter method for the system of nonlinear equations ⋮ A nonmonotone line search filter algorithm for the system of nonlinear equations ⋮ A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties ⋮ A null space method for solving system of equations. ⋮ Study of a primal-dual algorithm for equality constrained minimization ⋮ Newton's iterates can converge to non-stationary points ⋮ An SQP approach with line search for a system of nonlinear equations ⋮ A line search filter approach for the system of nonlinear equations ⋮ An interior-point piecewise linear penalty method for nonlinear programming ⋮ Newton methods to solve a system of nonlinear algebraic equations ⋮ Nonmonotone filter DQMM method for the system of nonlinear equations ⋮ An interior algorithm for nonlinear optimization that combines line search and trust region steps ⋮ Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties ⋮ Global and local convergence of a filter line search method for nonlinear programming ⋮ A local search method for optimization problem with d.c. inequality constraints ⋮ A globally convergent primal-dual interior-point relaxation method for nonlinear programs ⋮ Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs ⋮ Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions ⋮ Critical Point-Finding Methods Reveal Gradient-Flat Regions of Deep Network Losses ⋮ A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs ⋮ Global convergence enhancement of classical linesearch interior point methods for MCPs ⋮ A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints

Uses Software

• PETSc

This page was built for publication: On the convergence of Newton iterations to non-stationary points