Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches

DOI10.1093/IMAMAT/15.1.9MaRDI QIDQ4047413zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(16)

• Generating conjugate directions without line searches using factorized variable metric updating formulas
• Comparison of direct optimization algorithms for dynamic network flow control
• scientific article; zbMATH DE number 4009671 (Why is no real title available?)
• Minimization of extended quadratic functions with inexact line searches
• scientific article; zbMATH DE number 3793305 (Why is no real title available?)
• Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
• Readily implementable conjugate gradient methods
• A generalized conjugate gradient algorithm for minimization
• Minimization of extended quadratic functions
• Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations
• Conjugate direction methods with variable storage
• Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
• Orthogonality correction in the conjugate-gradient method
• Use of a nonquadratic model in a conjugate-gradient method of optimization with inexact line searches, unconstrained minimization
• scientific article; zbMATH DE number 3963115 (Why is no real title available?)
• New imperfect conjugate gradient algorithm

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

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