A new conjugate gradient method for acceleration of gradient descent algorithms

DOI10.2478/MJPAA-2021-0001MaRDI QIDQ6491230zbMATH OpenFDO

Authors Noureddine Rahali, Mohammed Belloufi, Rachid Benzine

Publication date 24 April 2024

Published in Moroccan Journal of Pure and Applied Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/MJPAA-2021-0001

zbMATH Keywords

conjugate gradient methodglobal convergenceline searchunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Nonlinear programming (90C30)

Recommendations

• Acceleration of conjugate gradient algorithms for unconstrained optimization
• A new investigation of the conjugate gradient method for solving unconstrained optimization problems
• A new accelerated conjugate gradient method for large-scale unconstrained optimization
• A new hybrid conjugate gradient algorithm for unconstrained optimization
• A new type of descent conjugate gradient method with exact line search

Cites work

• A descent hybrid modification of the Polak-Ribière-Polyak conjugate gradient method
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A note on minimization problems and multistep methods
• A survey of quasi-Newton equations and quasi-Newton methods for optimization
• An efficient hybrid conjugate gradient method for unconstrained optimization
• An interior point algorithm for convex quadratic programming with strict equilibrium constraints
• An unconstrained optimization test functions collection
• Behavior of the combination of PRP and HZ methods for unconstrained optimization
• Benchmarking optimization software with performance profiles.
• Coercivity properties and well-posedness in vector optimization
• Convergence analysis of adaptive trust region methods
• Convergence Properties of the BFGS Algoritm
• Descent property and global convergence of a new search direction method for unconstrained optimization
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Efficient generalized conjugate gradient algorithms. I: Theory
• Existence of almost periodic solutions of a nonlinear system
• scientific article; zbMATH DE number 3843083 (Why is no real title available?)
• scientific article; zbMATH DE number 6394167 (Why is no real title available?)
• scientific article; zbMATH DE number 964462 (Why is no real title available?)
• Limited memory solution of bound constrained convex quadratic problems arising in video games
• Methods of conjugate gradients for solving linear systems
• Numerical analysis for a locally damped wave equation
• Numerical Optimization
• Quasi-Newton Methods, Motivation and Theory
• Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition
• The conjugate gradient method in extremal problems

Cited in

(1)

• A combination of two conjugate gradient methods under a new line search with its application in image restoration problems

This page was built for publication: A new conjugate gradient method for acceleration of gradient descent algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6491230)