Improving the Dai-Liao parameter choices using a fixed point equation
From MaRDI portal
Publication:5080095
DOI10.22124/jmm.2021.16900.1466zbMath1499.90215OpenAlexW3184064294MaRDI QIDQ5080095
Kafaki Saman Babaie, Zohre Aminifard
Publication date: 31 May 2022
Full work available at URL: https://jmm.guilan.ac.ir/article_4780_3fd4b03335a158c7fcf5fc946674ba67.pdf
unconstrained optimizationconjugate gradient methodfixed point equationfunctional iterationmaximum magnification
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods
- A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
- A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
- 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
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- Two optimal Dai–Liao conjugate gradient methods
- Algorithm 851
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A Note on Performance Profiles for Benchmarking Software
- 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
- CUTEr and SifDec
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
This page was built for publication: Improving the Dai-Liao parameter choices using a fixed point equation