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

DOI10.1080/01630569908816881MaRDI QIDQ4239757zbMATH OpenOpenAlexFDO

Authors 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 convergencesuperlinear convergenceGauss-Newton methodinexact line searchsymmetric equationsDennis-Fletcher-Powell method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical computation of solutions to systems of equations (65H10)

Recommendations

• A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations
• A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
• Superlinear convergence of the DFP algorithm without exact line search
• A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
• A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations
• A derivative-free method for nonlinear system of equations with global convergence
• On the Local and Superlinear Convergence of a Parameterized DFP Method
• A globally convergent BFGS method for symmetric nonlinear equations
• A global convergent derivative-free method for solving a system of non-linear equations
• Derivative-free conjugate gradient type methods for symmetric complementarity problems

Cites work

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

Cited in

(5)

• scientific article; zbMATH DE number 682565 (Why is no real title available?)
• Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
• A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
• An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems
• A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI

Describes a project that uses

Uses Software

• ve08

This page was built for publication: A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence

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