Practical convergence conditions for the Davidon-Fletcher-Powell method

DOI10.1007/BF01681331zbMath0329.90059OpenAlexW1973110562MaRDI QIDQ4097099

M. L. Lenard

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01681331

Mathematics Subject Classification ID

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

Related Items (5)

Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung ⋮ A hybrid algorithm for finding a global minimum ⋮ Numerically stable computation of step-sizes for descent methods. The nonconvex case ⋮ On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory ⋮ On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An effective algorithm for minimization
• Die Konvergenzordnung des Fletcher-Powell-Algorithmus
• Variable Metric Method for Minimization
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Rapidly Convergent Descent Method for Minimization
• Convergence Conditions for Ascent Methods
• On the Convergence of the Variable Metric Algorithm
• Recent advances in unconstrained optimization
• Practical convergence conditions for unconstrained optimization

This page was built for publication: Practical convergence conditions for the Davidon-Fletcher-Powell method