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
From MaRDI portal
Publication:2336064
DOI10.1007/S10288-018-0387-1zbMATH Open1425.90134OpenAlexW2893199587WikidataQ129189487 ScholiaQ129189487MaRDI QIDQ2336064FDOQ2336064
Authors: Zohre Aminifard, Saman Babaie-Kafaki 
Publication date: 18 November 2019
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-018-0387-1
Recommendations
- Matrix analyses on the Dai-Liao conjugate gradient method
- Two optimal Dai-Liao conjugate gradient methods
- A new Dai-Liao conjugate gradient method with optimal parameter choice
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- scientific article; zbMATH DE number 7267270
nonlinear programmingglobal convergenceunconstrained optimizationconjugate gradient methodmaximum magnification
Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Algorithm 851
- CUTEr and SifDec
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Optimization theory and methods. Nonlinear programming
- Technical Note—A Modified Conjugate Gradient Algorithm
- 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
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
- A survey of nonlinear conjugate gradient methods
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- Convergence Properties of Algorithms for Nonlinear Optimization
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- Title not available (Why is that?)
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
- Two new conjugate gradient methods based on modified secant equations
- 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
- A descent family of Dai-Liao conjugate gradient methods
- Multi-step nonlinear conjugate gradient methods for unconstrained minimization
- Two modified three-term conjugate gradient methods with sufficient descent property
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods
- An adaptive conjugate gradient algorithm for large-scale unconstrained optimization
- Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
- Two adaptive Dai-Liao nonlinear conjugate gradient methods
- Two optimal Dai-Liao conjugate gradient methods
- A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update
- A new efficient conjugate gradient method for unconstrained optimization
- A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update
- Title not available (Why is that?)
Cited In (19)
- Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
- A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems
- A hybrid quasi-Newton method with application in sparse recovery
- On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications
- A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems
- Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods
- Two optimal Dai-Liao conjugate gradient methods
- Matrix analyses on the Dai-Liao conjugate gradient method
- A restart scheme for the Dai-Liao conjugate gradient method by ignoring a direction of maximum magnification by the search direction matrix
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
- An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method
- A new structured spectral conjugate gradient method for nonlinear least squares problems
- A spectral three-term Hestenes-Stiefel conjugate gradient method
- Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring
- On optimality of two adaptive choices for the parameter of Dai-Liao method
- Improving the Dai-Liao parameter choices using a fixed point equation
- New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters
- A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction
- A modified spectral conjugate gradient method with global convergence
Uses Software
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336064)
