Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
Summary: To achieve the good features of the linear conjugate gradient algorithm in a recent extension of the Dai-Liao method, two adaptive choices for parameter of the extended method are proposed based on a penalization approach. It is shown that the suggested parameters guarantee the sufficient descent property independent to the line search and the objective function convexity. Furthermore, they ensure the global convergence of the related algorithm for uniformly convex objective functions. Using a set of unconstrained optimization test problems from the CUTEr library, effectiveness of the suggested choices are numerically compared with two other recently proposed adaptive choices. Results of comparisons show that one of the proposed choices is computationally promising in the sense of the Dolan-Moré performance profile.
- Two optimal Dai-Liao conjugate gradient methods
- An extended Dai-Liao conjugate gradient method with global convergence for nonconvex functions
- Two adaptive Dai-Liao nonlinear conjugate gradient methods
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- scientific article; zbMATH DE number 7267270
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update
- A descent family of Dai-Liao conjugate gradient methods
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A new efficient conjugate gradient method for unconstrained optimization
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A survey of nonlinear conjugate gradient methods
- Algorithm 851
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Optimal conditioning of self-scaling variable Metric algorithms
- Optimization theory and methods. Nonlinear programming
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- Two modified three-term conjugate gradient methods with sufficient descent property
- Two optimal Dai-Liao conjugate gradient methods
This page was built for publication: Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653949)
