Methods of conjugate directions versus quasi-Newton methods

DOI10.1007/BF01584978zbMath0247.90055OpenAlexW2050762313MaRDI QIDQ5661719

Garth P. McCormick, Klaus Ritter

Publication date: 1972

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

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

Mathematics Subject Classification ID

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

Related Items

A quasi-Newton method with Cholesky factorization, A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods, Convergence conditions for restarted conjugate gradient methods with inaccurate line searches, A superlinearly convergent algorithm for minimization without evaluating derivatives, A method to accelerate the rate of convergence of a class of optimization algorithms, Matrix conditioning and nonlinear optimization, A fast quasi-Newton method for semi-supervised SVM, On the accelerating property of an algorithm for function minimization without calculating derivatives, Accelerated conjugate direction methods for unconstrained optimization, 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, A quasi-Newton method can be obtained from a method of conjugate directions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An effective algorithm for minimization
• Projection method for unconstrained optimization
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
• Variance algorithm for minimization
• The Local Dependence of Least Squares Cubic Splines
• A Technique for Orthogonalization
• A New Algorithm for Unconstrained Optimization
• Methods of conjugate gradients for solving linear systems