A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence

DOI10.1080/01630569908816881zbMath0927.65067MaRDI QIDQ4239757

Masao Fukushima, Dong-hui Li

Publication date: 14 December 1999

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

global convergence; inexact line search; superlinear convergence; Gauss-Newton method; symmetric equations; Dennis-Fletcher-Powell method

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

65H10: Numerical computation of solutions to systems of equations

Uses Software

• ve08

Cites Work

• Unnamed Item
• Unnamed Item
• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
• Local convergence analysis for partitioned quasi-Newton updates
• Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
• Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
• The “global” convergence of Broyden-like methods with suitable line search
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• Quasi-Newton Methods, Motivation and Theory
• A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• On the Convergence of the Variable Metric Algorithm