New properties of a nonlinear conjugate gradient method
From MaRDI portal
This paper provides several new properties of the nonlinear conjugate gradient method in by \textit{Y. H. Dai} and \textit{Y. Yuan} [SIAM J. Optim. 10, No.~1, 177-182 (1999; Zbl 0957.65061)]. Firstly , the method is proved to have a certain self adjusting property that is independent of the line search and the function convexity . Secondly, under mild assumptions on the objective function, the method is shown to be globally convergent with a variety of fine searches. Thirdly, the author finds that instead of the negative gradient direction, the search direction defined by the nonlinear conjugate gradient method of Dai and Yuan [loc. cit.] can be used to restart any optimization method while guaranteeing the global convergence of the method. Some numerical results are also presented.
Recommendations
- scientific article; zbMATH DE number 1186897
- scientific article; zbMATH DE number 6310924
- A conjugate gradient method with sufficient descent property
- A new nonlinear conjugate gradient method with guaranteed global convergence
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
Cited in
(41)- Two modified Dai-Yuan nonlinear conjugate gradient methods
- Hybrid conjugate gradient algorithm for unconstrained optimization
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems
- Improved conjugate gradient method for nonlinear system of equations
- The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
- Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
- The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- A new family of conjugate gradient methods
- A hybrid conjugate gradient method based on a quadratic relaxation of the Dai-Yuan hybrid conjugate gradient parameter
- Global convergence of a new restarting three terms conjugate gradient method for non-linear optimizations
- A hybridization of the Hestenes-Stiefel and Dai-Yuan conjugate gradient methods based on a least-squares approach
- A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties
- A mixed spectral CD-DY conjugate gradient method
- A family of hybrid conjugate gradient methods for unconstrained optimization
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods
- A modified HS-DY-type method with nonmonotone line search for image restoration and unconstrained optimization problems
- An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization
- Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search
- Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method
- Two hybrid nonlinear conjugate gradient methods based on a modified secant equation
- Comparisons and improvements concerning the accuracy and robustness of inverse heat conduction algorithms
- A family of gradient methods using Householder transformation with application to hypergraph partitioning
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
- A new hybrid three-term LS-CD conjugate gradient in solving unconstrained optimization problems
- Two modified hybrid conjugate gradient methods for nonconvex vector optimization
- Improved Dai-Yuan iterative schemes for convex constrained monotone nonlinear systems
- A novel stochastic conjugate gradient algorithm based on a stochastic differential equation perspective
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique
- A restart derivative-free algorithm for solving pseudomonotone equations
- A new class of supermemory gradient methods
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method
- Convergence of Liu-Storey conjugate gradient method
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
This page was built for publication: New properties of a nonlinear conjugate gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5944728)
