A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
From MaRDI portal
Publication:408488
DOI10.5402/2012/435495zbMath1245.65067OpenAlexW2052113316WikidataQ58690432 ScholiaQ58690432MaRDI QIDQ408488
Ioannis E. Livieris, Panagiotis Pintelas
Publication date: 10 April 2012
Published in: ISRN Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5402/2012/435495
Related Items (12)
An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its application in image restoration problems ⋮ Descent Perry conjugate gradient methods for systems of monotone nonlinear equations ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ A novel value for the parameter in the Dai-Liao-type conjugate gradient method ⋮ The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices ⋮ Spectral three-term constrained conjugate gradient algorithm for function minimizations ⋮ Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations ⋮ Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations ⋮ A new accelerated conjugate gradient method for large-scale unconstrained optimization ⋮ 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 ⋮ A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION ⋮ Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A variant spectral-type FR conjugate gradient method and its global convergence
- Global convergence of some modified PRP nonlinear conjugate gradient methods
- Sufficient descent nonlinear conjugate gradient methods with conjugacy condition
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- Efficient generalized conjugate gradient algorithms. I: Theory
- Global convergence of a modified spectral FR conjugate gradient method
- Multi-step nonlinear conjugate gradient methods for unconstrained minimization
- Two new conjugate gradient methods based on modified secant equations
- Two modified Dai-Yuan nonlinear conjugate gradient methods
- New versions of the Hestenes-Stiefel nonlinear conjugate gradient method based on the secant condition for optimization
- New quasi-Newton equation and related methods for unconstrained optimization
- Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Two descent hybrid conjugate gradient methods for optimization
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Numerical Optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- Benchmarking optimization software with performance profiles.
This page was built for publication: A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence