A novel value for the parameter in the Dai-Liao-type conjugate gradient method
DOI10.1155/2021/6693401zbMATH Open1460.65079OpenAlexW3127862007MaRDI QIDQ2228067FDOQ2228067
Authors: Branislav Ivanov, Predrag S. Stanimirović, Bilall I. Shaini, Hijaz Ahmad, Miao-Kun Wang 
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
Recommendations
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation
- A new investigation of the conjugate gradient method for solving unconstrained optimization problems
- scientific article; zbMATH DE number 7267270
- New investigation for the Liu-Story scaled conjugate gradient method for nonlinear optimization
- A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice
Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26)
Cites Work
- Algorithm 851
- CUTE
- Benchmarking optimization software with performance profiles.
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- An unconstrained optimization test functions collection
- Title not available (Why is that?)
- 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
- Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation
- A new class of efficient and globally convergent conjugate gradient methods in the Dai-Liao family
- A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
- Accelerated gradient descent methods with line search
- A sufficient descent conjugate gradient method and its global convergence
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
- A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
- A conjugate gradient method with global convergence for large-scale unconstrained optimization problems
- A hybrid of DL and WYL nonlinear conjugate gradient methods
- 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
Cited In (3)
- A novel characteristic value correction iteration method
- Addendum to: A hybrid conjugate gradient method based on a quadratic relaxation of Dai–Yuan hybrid conjugate gradient parameter
- Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring
Uses Software
This page was built for publication: A novel value for the parameter in the Dai-Liao-type conjugate gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228067)
