Convergence of the DFP algorithm without exact line search

DOI10.1023/A:1013004914923zbMath0993.65071OpenAlexW46252701MaRDI QIDQ5959907

Dinguo Pu

Publication date: 11 April 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013004914923

zbMATH Keywords

quadratic convergencesuperlinear convergenceline searchDennis-Fletcher-Powell algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (7)

Optimal decentralized control of a wind turbine and diesel generator system ⋮ A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications ⋮ Eigenvalue analyses on the memoryless Davidon-Fletcher-Powell method based on a spectral secant equation ⋮ Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing ⋮ On the Local and Superlinear Convergence of a Parameterized DFP Method ⋮ The revised DFP algorithm without exact line search ⋮ A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence property of the DFP algorithm
• Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• Quasi-Newton Methods, Motivation and Theory
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• A Rapidly Convergent Descent Method for Minimization
• On the Convergence of the Variable Metric Algorithm

This page was built for publication: Convergence of the DFP algorithm without exact line search