Some remarks on conjugate gradient methods without line search

DOI10.1016/J.AMC.2006.01.040zbMath1155.65353OpenAlexW2114080204MaRDI QIDQ945376

Cheng-Jing Wang

Publication date: 12 September 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.01.040

zbMATH Keywords

conjugate gradient methodslimited memory BFGS methodminimizing method``fixed steplengthwithout line search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Iterative numerical methods for linear systems (65F10) Methods of reduced gradient type (90C52)

Uses Software

• L-BFGS
• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global convergence of a two-parameter family of conjugate gradient methods without line search
• Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
• QN-like variable storage conjugate gradients
• Two-Point Step Size Gradient Methods
• A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
• Testing Unconstrained Optimization Software
• Updating Quasi-Newton Matrices with Limited Storage
• A combined conjugate-gradient quasi-Newton minimization algorithm
• Conjugate Gradient Methods with Inexact Searches
• On the Convergence of a New Conjugate Gradient Algorithm
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• Global convergence of conjugate gradient methods without line search

This page was built for publication: Some remarks on conjugate gradient methods without line search