New properties of a nonlinear conjugate gradient method
From MaRDI portal
Publication:5944728
DOI10.1007/PL00005464zbMath1006.65063OpenAlexW2004081181MaRDI QIDQ5944728
Publication date: 10 June 2002
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00005464
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Related Items (34)
A family of hybrid conjugate gradient methods for unconstrained optimization ⋮ A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach ⋮ Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors ⋮ A new class of supermemory gradient methods ⋮ Convergence of the Polak-Ribiére-Polyak conjugate gradient method ⋮ A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization ⋮ Convergence of Liu-Storey conjugate gradient method ⋮ A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods ⋮ A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties ⋮ A family of gradient methods using Householder transformation with application to hypergraph partitioning ⋮ A mixed spectral CD-DY conjugate gradient method ⋮ Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems ⋮ Two effective hybrid conjugate gradient algorithms based on modified BFGS updates ⋮ On the sufficient descent condition of the Hager-Zhang conjugate gradient methods ⋮ A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization ⋮ Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search ⋮ Another hybrid conjugate gradient algorithm for unconstrained optimization ⋮ A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems ⋮ Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization ⋮ Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization ⋮ Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method ⋮ An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems ⋮ New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization ⋮ A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique ⋮ Unnamed Item ⋮ An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization ⋮ A new family of conjugate gradient methods ⋮ Two modified Dai-Yuan nonlinear conjugate gradient methods ⋮ The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems ⋮ Hybrid conjugate gradient algorithm for unconstrained optimization ⋮ Comparisons and improvements concerning the accuracy and robustness of inverse heat conduction algorithms ⋮ Two hybrid nonlinear conjugate gradient methods based on a modified secant equation ⋮ The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems ⋮ A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter
This page was built for publication: New properties of a nonlinear conjugate gradient method