On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications

DOI10.1007/BF01404342zbMath0366.65028MaRDI QIDQ1241970

Josef Stoer, Peter Baptist

Publication date: 1977

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132493

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C30: Nonlinear programming

Related Items

Imperfect conjugate gradient algorithms for extended quadratic functions, A generalized conjugate gradient algorithm for minimization, 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, Superlinear convergence of symmetric Huang's class of methods, A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method, Nonlinear conjugate gradient methods for the optimal control of laser surface hardening, Unnamed Item, Accelerated Gauss-Newton algorithms for nonlinear least squares problems, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory
• Alternative proofs of the convergence properties of the conjugate- gradient method
• Die Konvergenzordnung des Fletcher-Powell-Algorithmus
• Variable Metric Method for Minimization
• Self-Scaling Variable Metric (SSVM) Algorithms
• Self-Scaling Variable Metric (SSVM) Algorithms
• Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
• Practical convergence conditions for the Davidon-Fletcher-Powell method
• On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
• Rate of Convergence of Several Conjugate Gradient Algorithms
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
• Quasi-Newton Methods and their Application to Function Minimisation
• Variable metric methods of minimisation
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• Methods of conjugate directions versus quasi-Newton methods
• Practical convergence conditions for unconstrained optimization