Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
From MaRDI portal
Publication:1653949
zbMath1398.65136MaRDI QIDQ1653949
Saman Babaie-Kafaki, Masoud Fatemi
Publication date: 7 August 2018
Published in: Bulletin of Computational Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://drive.google.com/open?id=0B5GyVVQ6O030by16cjU0TEJHdWc
unconstrained optimizationconjugate gradient methodpenalty methodline searchsufficient descent property
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- Two modified three-term conjugate gradient methods with sufficient descent property
- Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems
- Optimization theory and methods. Nonlinear programming
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Two optimal Dai–Liao conjugate gradient methods
- Algorithm 851
- Optimal conditioning of self-scaling variable Metric algorithms
- 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
- 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.
- A new efficient conjugate gradient method for unconstrained optimization
This page was built for publication: Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
