Two diagonal conjugate gradient like methods for unconstrained optimization

DOI10.3934/JIMO.2023073OpenAlexW4381663178MaRDI QIDQ6065141

Mustafa Mamat, Hassan Mohammad, Sulaiman Ibrahim Mohammed

Publication date: 11 December 2023

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2023073

zbMATH Keywords

unconstrained optimizationglobal convergencenumerical resultsconjugate gradient methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
• Recent advances in numerical methods for nonlinear equations and nonlinear least squares
• Efficient generalized conjugate gradient algorithms. I: Theory
• A descent spectral conjugate gradient method for impulse noise removal
• A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
• A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares
• A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
• The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems
• Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems
• Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration
• Two modified DY conjugate gradient methods for unconstrained optimization problems
• The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
• Optimization theory and methods. Nonlinear programming
• A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Globally convergent conjugate gradient algorithms
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• An efficient modified Polak–Ribière–Polyak conjugate gradient method with global convergence properties
• Convergence properties of the Fletcher-Reeves method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.

This page was built for publication: Two diagonal conjugate gradient like methods for unconstrained optimization