New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters

DOI10.22124/jmm.2019.14737.1338zbMath1474.90449OpenAlexW3015937822MaRDI QIDQ5855678

Saeed Nezhadhosein

Publication date: 19 March 2021

Full work available at URL: https://jmm.guilan.ac.ir/article_3761_9ec492a73d7c2133260765303eb94ede.pdf

zbMATH Keywords

unconstrained optimizationDai-Liao conjugate gradient methodmodified secant equations

Mathematics Subject Classification ID

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

Related Items (2)

An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method ⋮ Unnamed Item

Uses Software

• CUTEr

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On optimality of two adaptive choices for the parameter of Dai-Liao method
• Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• Two new conjugate gradient methods based on modified secant equations
• New quasi-Newton equation and related methods for unconstrained optimization
• Multi-step quasi-Newton methods for optimization
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
• An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix
• New quasi-Newton methods for unconstrained optimization problems
• Optimization theory and methods. Nonlinear programming
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
• On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
• A Modified BFGS Algorithm for Unconstrained Optimization
• A nonlinear conjugate gradient method based on the MBFGS secant condition
• Two optimal Dai–Liao conjugate gradient methods
• A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach
• Technical Note—A Modified Conjugate Gradient Algorithm
• Conjugate Gradient Methods with Inexact Searches
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• Some descent three-term conjugate gradient methods and their global convergence
• CUTEr and SifDec
• Convergence Conditions for Ascent Methods
• The conjugate gradient method in extremal problems
• A descent family of Dai–Liao conjugate gradient methods
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• A modified BFGS method and its global convergence in nonconvex minimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters