Die Konvergenzordnung des Fletcher-Powell-Algorithmus

DOI10.1002/zamm.19730531007zbMath0269.90039OpenAlexW2093192013MaRDI QIDQ3212925

Wolfgang Burmeister

Publication date: 1973

Published in: ZAMM - Zeitschrift für Angewandte Mathematik und Mechanik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/zamm.19730531007

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items (14)

The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations ⋮ \(n\)-step quadratic convergence of a restart Liu-Storey type method ⋮ The convergence rate of a restart MFR conjugate gradient method with inexact line search ⋮ On the rate of superlinear convergence of a class of variable metric methods ⋮ \(n\)-step quadratic convergence of the MPRP method with a restart strategy ⋮ Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. I: Verfahren und grundlegende Eigenschaften ⋮ Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. II: n-Schritt-quadratische Konvergenz für Restart-Varianten ⋮ A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems ⋮ A hybrid algorithm for finding a global minimum ⋮ Practical convergence conditions for the Davidon-Fletcher-Powell method ⋮ On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class ⋮ 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 ⋮ The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems

Cites Work

• A Rapidly Convergent Descent Method for Minimization

This page was built for publication: Die Konvergenzordnung des Fletcher-Powell-Algorithmus