A combined conjugate-gradient quasi-Newton minimization algorithm

DOI10.1007/BF01609018zbMATH Open0386.90051OpenAlexW2062542688MaRDI QIDQ4168787FDOQ4168787

Authors: Albert G. Buckley 

Publication date: 1978

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

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30)

Cites Work

• A General Quadratic Programming Algorithm
• A Rapidly Convergent Descent Method for Minimization
• A new approach to variable metric algorithms
• Restart procedures for the conjugate gradient method
• Methods of conjugate gradients for solving linear systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some convergence properties of the conjugate gradient method
• Extending the relationship between the conjugate gradient and BFGS algorithms
• A conjugate-gradient optimization method invariant to nonlinear scaling
• Title not available (Why is that?)

Cited In (18)

• Globally convergent algorithms for solving unconstrained optimization problems
• On Variable-Metric Methods for Sparse Hessians
• Oblique projections, Broyden restricted class and limited-memory quasi-Newton methods
• The application of optimal control methodology to nonlinear programming problems
• Conjugate direction methods with variable storage
• Updating Quasi-Newton Matrices with Limited Storage
• Some computational advances in unconstrained optimization
• Title not available (Why is that?)
• QN-like variable storage conjugate gradients
• Empirical analysis of different hybridization strategies for solving systems of nonlinear equations
• Extending the relationship between the conjugate gradient and BFGS algorithms
• Variable metric methods for unconstrained optimization and nonlinear least squares
• A fast and robust unconstrained optimization method requiring minimum storage
• On the limited memory BFGS method for large scale optimization
• Some remarks on conjugate gradient methods without line search
• Some numerical experiments with variable-storage quasi-Newton algorithms
• A new nonmonotone line search technique for unconstrained optimization
• Accelerated solution techniques and concrete cracking

This page was built for publication: A combined conjugate-gradient quasi-Newton minimization algorithm

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