On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory

DOI10.1007/BF01389973zbMATH Open0366.65027OpenAlexW93171880MaRDI QIDQ1241969FDOQ1241969

Authors: Josef Stoer 

Publication date: 1977

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

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

Mathematics Subject Classification ID

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

Cites Work

• Variable Metric Method for Minimization
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• A new approach to variable metric algorithms
• Quasi-Newton Methods, Motivation and Theory
• Title not available (Why is that?)
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• Self-Scaling Variable Metric (SSVM) Algorithms
• Self-Scaling Variable Metric (SSVM) Algorithms
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
• Quasi-Newton Methods and their Application to Function Minimisation
• Variable metric methods of minimisation
• Die Konvergenzordnung des Fletcher-Powell-Algorithmus
• Rate of Convergence of Several Conjugate Gradient Algorithms
• On the Convergence of the Variable Metric Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Alternative proofs of the convergence properties of the conjugate- gradient method
• On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
• Practical convergence conditions for the Davidon-Fletcher-Powell method
• Methods of conjugate directions versus quasi-Newton methods
• Practical convergence conditions for unconstrained optimization
• Title not available (Why is that?)
• Convergence conditions for restarted conjugate gradient methods with inaccurate line searches

Cited In (10)

• Title not available (Why is that?)
• Nonlinear conjugate gradient methods for the optimal control of laser surface hardening
• Imperfect conjugate gradient algorithms for extended quadratic functions
• On the stable global convergence of particular quasi-newton-methods
• A generalized conjugate gradient algorithm for minimization
• On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications
• Superlinear convergence of symmetric Huang's class of methods
• 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 derivative-based bracketing scheme for univariate minimization and the conjugate gradient method

This page was built for publication: On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241969)