Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems

DOI10.1007/s10957-017-1140-1zbMath1380.65108OpenAlexW2736319691MaRDI QIDQ1686668

Bing Zheng, Yu-Tao Zheng

Publication date: 15 December 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-017-1140-1

zbMATH Keywords

unconstrained optimizationglobal convergencestrong convergencenumerical resultstrong Wolfe line searchDai-Liao-type methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items

Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization ⋮ Two families of self-adjusting spectral hybrid DL conjugate gradient methods and applications in image denoising ⋮ An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its application in image restoration problems ⋮ A Dai-Liao-type projection method for monotone nonlinear equations and signal processing ⋮ New three-term conjugate gradient algorithm for solving monotone nonlinear equations and signal recovery problems ⋮ A class of spectral three-term descent Hestenes-Stiefel conjugate gradient algorithms for large-scale unconstrained optimization and image restoration problems ⋮ A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems ⋮ Unnamed Item ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods ⋮ A novel value for the parameter in the Dai-Liao-type conjugate gradient method ⋮ PRP-like algorithm for monotone operator equations ⋮ Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization ⋮ A modified spectral conjugate gradient method with global convergence

Uses Software

• CUTEst

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• A hybrid of DL and WYL nonlinear conjugate gradient methods
• A conjugate gradient method with global convergence for large-scale unconstrained optimization problems
• Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• Optimization theory and methods. Nonlinear programming
• A sufficient descent conjugate gradient method and its global convergence
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.

This page was built for publication: Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems