A simple three-term conjugate gradient algorithm for unconstrained optimization
From MaRDI portal
Publication:120734
DOI10.1016/j.cam.2012.10.002zbMath1258.65056OpenAlexW2000942978MaRDI QIDQ120734
Neculai Andrei, Neculai Andrei
Publication date: March 2013
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2012.10.002
algorithmunconstrained optimizationglobal convergenceconjugacy conditionnumerical comparisonsHestenes-Stiefel methoddescent conditionthree-term conjugate gradientBroyden-Fletcher-Goldfarb-Shanno (BFGS) quasi Newton method
Related Items (43)
Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination ⋮ Comment on ``A new three-term conjugate gradient method for unconstrained problem ⋮ Derivative-free method based on DFP updating formula for solving convex constrained nonlinear monotone equations and application ⋮ An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection ⋮ An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems ⋮ A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems ⋮ An improved Perry conjugate gradient method with adaptive parameter choice ⋮ New three-term conjugate gradient method with guaranteed global convergence ⋮ An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix ⋮ A subspace conjugate gradient algorithm for large-scale unconstrained optimization ⋮ A class of spectral three-term descent Hestenes-Stiefel conjugate gradient algorithms for large-scale unconstrained optimization and image restoration problems ⋮ A new modified three-term conjugate gradient method with sufficient descent property and its global convergence ⋮ A modified four-term extension of the Dai-Liao conjugate gradient method ⋮ Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization ⋮ A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model ⋮ A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems ⋮ A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property ⋮ Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition ⋮ A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems ⋮ Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization ⋮ A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method ⋮ A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations ⋮ New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction ⋮ An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization ⋮ Some three-term conjugate gradient methods with the inexact line search condition ⋮ A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations ⋮ A new three-term conjugate gradient algorithm for unconstrained optimization ⋮ ttcg ⋮ A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization ⋮ Some three-term conjugate gradient methods with the new direction structure ⋮ A class of globally convergent three-term Dai-Liao conjugate gradient methods ⋮ Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations ⋮ A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration ⋮ A new accelerated conjugate gradient method for large-scale unconstrained optimization ⋮ Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications ⋮ A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION ⋮ A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations ⋮ Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization
Uses Software
This page was built for publication: A simple three-term conjugate gradient algorithm for unconstrained optimization
