Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches

DOI10.1093/IMAMAT/15.1.9zbMath0294.90076OpenAlexW2015330748MaRDI QIDQ4047413

L. C. W. Dixon

Publication date: 1975

Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamat/15.1.9

Mathematics Subject Classification ID

Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items (16)

Minimization of extended quadratic functions with inexact line searches ⋮ New imperfect conjugate gradient algorithm ⋮ A generalized conjugate gradient algorithm for minimization ⋮ Minimization of extended quadratic functions ⋮ Comparison of direct optimization algorithms for dynamic network flow control ⋮ Convergence conditions for restarted conjugate gradient methods with inaccurate line searches ⋮ Unnamed Item ⋮ Readily implementable conjugate gradient methods ⋮ Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method ⋮ Unnamed Item ⋮ Generating conjugate directions without line searches using factorized variable metric updating formulas ⋮ Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations ⋮ Unnamed Item ⋮ Use of a nonquadratic model in a conjugate-gradient method of optimization with inexact line searches, unconstrained minimization ⋮ Orthogonality correction in the conjugate-gradient method ⋮ Conjugate direction methods with variable storage

This page was built for publication: Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches