New conjugate gradient-like methods for unconstrained optimization

DOI10.1080/10556788.2014.898764MaRDI QIDQ2926084zbMATH OpenOpenAlexFDO

Authors Bin Dan, Yang Zhang

Publication date 29 October 2014

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2014.898764

zbMATH Keywords

conjugate gradient methodglobal convergenceline searchsufficient descent conditionunconstrained optimization

Mathematics Subject Classification ID

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

Recommendations

• A new conjugate gradient method for unconstrained optimization
• Two new conjugate gradient methods for unconstrained optimization
• The convergence properties of some new conjugate gradient methods
• New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
• A new conjugate gradient method for unconstrained optimization

Cites work

• A gradient-related algorithm with inexact line searches
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties
• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• A Two-Term PRP-Based Descent Method
• Algorithm 851
• Benchmarking optimization software with performance profiles.
• Convergence properties of the Fletcher-Reeves method
• CUTEr and SifDec
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Function minimization by conjugate gradients
• Global convergence of a memory gradient method for unconstrained optimization
• Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Global convergence result for conjugate gradient methods
• Memory gradient method for the minimization of functions
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Study on a supermemory gradient method for the minimization of functions
• Two-Point Step Size Gradient Methods

Cited in

(15)

• A new taxonomy of conjugate gradient methods
• Two new conjugate gradient methods for unconstrained optimization
• New conjugate gradient method for unconstrained optimization
• Conjugate Gradient Methods less Dependent on Conjugacy
• A new conjugate gradient method for unconstrained optimization
• A new conjugate gradient method for unconstrained optimization
• On Conjugate Gradient Algorithms as Objects of Scientific Study
• New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
• A modified form of conjugate gradient method for unconstrained optimization problems
• New iterative conjugate gradient method for nonlinear unconstrained optimization
• A new weighted conjugate gradient method
• A new conjugate gradient method for unconstrained optimization with sufficient descent
• Solving unconstrained optimization with a new type of conjugate gradient method
• Two diagonal conjugate gradient like methods for unconstrained optimization
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization

Describes a project that uses

Uses Software

• CG_DESCENT

This page was built for publication: New conjugate gradient-like methods for unconstrained optimization

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