A novel value for the parameter in the Dai-Liao-type conjugate gradient method
From MaRDI portal
Publication:2228067
DOI10.1155/2021/6693401zbMath1460.65079OpenAlexW3127862007MaRDI QIDQ2228067
Hijaz Ahmad, Branislav Ivanov, Bilall I. Shaini, Miao-Kun Wang, Predrag S. Stanimirović
Publication date: 16 February 2021
Published in: Journal of Function Spaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/6693401
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
- A hybrid of DL and WYL nonlinear conjugate gradient methods
- A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
- 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
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- A sufficient descent conjugate gradient method and its global convergence
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- A new class of efficient and globally convergent conjugate gradient methods in the Dai–Liao family
- Algorithm 851
- CUTE
- 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
- A Two-Term PRP-Based Descent Method
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
- Accelerated gradient descent methods with line search
This page was built for publication: A novel value for the parameter in the Dai-Liao-type conjugate gradient method