A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice
From MaRDI portal
Publication:4632353
DOI10.1080/01630563.2018.1535506zbMath1411.90329OpenAlexW2900576582MaRDI QIDQ4632353
No author found.
Publication date: 29 April 2019
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2018.1535506
unconstrained optimizationglobal convergenceconjugate gradient methodspectral condition numbersufficient descent condition
Related Items (6)
New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters ⋮ An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its application in image restoration problems ⋮ A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model ⋮ On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications ⋮ A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems ⋮ Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations
Uses Software
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
- Applying powell's symmetrical technique to conjugate gradient methods
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
- Optimization theory and methods. Nonlinear programming
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- Descent Symmetrization of the Dai–Liao Conjugate Gradient Method
- AN ADAPTIVE CONJUGACY CONDITION AND RELATED NONLINEAR CONJUGATE GRADIENT METHODS
- Two optimal Dai–Liao conjugate gradient methods
- A new class of efficient and globally convergent conjugate gradient methods in the Dai–Liao family
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Numerical Optimization
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- 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
- The Limited Memory Conjugate Gradient Method
- CUTEr and SifDec
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- 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
- Benchmarking optimization software with performance profiles.
This page was built for publication: A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice
