The convergence of Broyden algorithms for LC gradient function

DOI10.1007/BF02679896zbMath0962.90046OpenAlexW197201855MaRDI QIDQ1582577

Pu, Dingguo

Publication date: 21 June 2001

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

linear convergencesuperlinear convergenceuniformly convex functionBroyden algorithmsLC-gradientsunrestricted nonlinear programming

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (3)

Superlinear convergence of the DFP algorithm without exact line search ⋮ 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
• Stability of majorly efficient points and solutions in multiobjective programming
• 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
• Variable metric methods of minimisation
• On the Convergence of the Variable Metric Algorithm

This page was built for publication: The convergence of Broyden algorithms for LC gradient function