On the convergence property of the DFP algorithm
From MaRDI portal
Publication:803046
DOI10.1007/BF02216822zbMath0726.90076MaRDI QIDQ803046
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (12)
A new family of globally convergent conjugate gradient methods ⋮ A class of one parameter conjugate gradient methods ⋮ A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties ⋮ Further insight into the convergence of the Fletcher-Reeves method ⋮ A regularized limited memory BFGS method for nonconvex unconstrained minimization ⋮ Convergence property of a class of variable metric methods. ⋮ Superlinear convergence of the DFP algorithm without exact line search ⋮ Convergence of the DFP algorithm without exact line search ⋮ The revised DFP algorithm without exact line search ⋮ The convergence of Broyden algorithms for LC gradient function ⋮ A new two-parameter family of nonlinear conjugate gradient methods ⋮ A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
Cites Work
This page was built for publication: On the convergence property of the DFP algorithm
