Convergence of the DFP algorithm without exact line search

DOI10.1023/A:1013004914923MaRDI QIDQ5959907zbMATH OpenOpenAlexFDO

Authors 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

Dennis-Fletcher-Powell algorithmline searchquadratic convergencesuperlinear convergence

Mathematics Subject Classification ID

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

Recommendations

• Convergence of DFP algorithms without convexity and exact line search assumptions
• Superlinear convergence of the DFP algorithm without exact line search
• scientific article; zbMATH DE number 4112394
• Convergence of DFP algorithm
• On the convergence property of the DFP algorithm
• The revised DFP algorithm without exact line search
• scientific article; zbMATH DE number 1310905
• Convergence Properties of the DFP Algorithm for Unconstrained Optimization
• scientific article; zbMATH DE number 1185967
• scientific article; zbMATH DE number 232393

Cites work

• A Class of Methods for Solving Nonlinear Simultaneous Equations
• A Rapidly Convergent Descent Method for Minimization
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• scientific article; zbMATH DE number 3529352 (Why is no real title available?)
• scientific article; zbMATH DE number 721769 (Why is no real title available?)
• scientific article; zbMATH DE number 857603 (Why is no real title available?)
• scientific article; zbMATH DE number 232393 (Why is no real title available?)
• On the Convergence of the Variable Metric Algorithm
• On the convergence property of the DFP algorithm
• Quasi-Newton Methods, Motivation and Theory
• Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions

Cited in

(16)

• The revised DFP algorithm without exact line search
• Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
• Convergence of DFP algorithms without convexity and exact line search assumptions
• A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
• scientific article; zbMATH DE number 4048294 (Why is no real title available?)
• scientific article; zbMATH DE number 4112394 (Why is no real title available?)
• scientific article; zbMATH DE number 1185967 (Why is no real title available?)
• scientific article; zbMATH DE number 1310905 (Why is no real title available?)
• scientific article; zbMATH DE number 232393 (Why is no real title available?)
• On the Local and Superlinear Convergence of a Parameterized DFP Method
• Superlinear convergence of the DFP algorithm without exact line search
• 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
• An augmented memoryless Davidon–Fletcher–Powell method based on the Dai–Liao approach
• Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds

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

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