On the stable global convergence of particular quasi-newton-methods

DOI10.1080/02331939208843845zbMath0817.90107OpenAlexW2050151464MaRDI QIDQ4327964

Ursula Felgenhauer

Publication date: 1 August 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843845

zbMATH Keywords

stabilityquasi-Newton methods\(q\)-superlinear convergenceBFGS-methodinexact gradientsGoldstein-Armijo step length rule

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Mathematical programming (90C99)

Related Items

On bilevel programming. I: General nonlinear cases

Cites Work

• Unnamed Item
• Unnamed Item
• Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
• On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory
• Local convergence analysis for partitioned quasi-Newton updates
• The “global” convergence of Broyden-like methods with suitable line search
• Least-Change Sparse Secant Update Methods with Inaccurate Secant Conditions
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• Inexact Secant Methods for Nonlinear Constrained Optimization
• On the Local and Superlinear Convergence of Quasi-Newton Methods