A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems

DOI10.1007/s11075-022-01448-yOpenAlexW4309048188MaRDI QIDQ6156109

Gong Lin Yuan, Xiaoliang Wang, Li-Ping Pang

Publication date: 12 June 2023

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-022-01448-y

zbMATH Keywords

global convergenceconjugate gradientsufficient descent propertynonconvex functionsgradient Lipschitz continuity condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical analysis (65-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
• A modified scaled conjugate gradient method with global convergence for nonconvex functions
• Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
• Convergence analysis of a modified BFGS method on convex minimizations
• A descent spectral conjugate gradient method for impulse noise removal
• An improved Perry conjugate gradient method with adaptive parameter choice
• Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
• A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
• Nonlinear conjugate gradient methods for unconstrained optimization
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
• The projection technique for two open problems of unconstrained optimization problems
• Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
• A class of globally convergent three-term Dai-Liao conjugate gradient methods
• The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
• New quasi-Newton methods for unconstrained optimization problems
• An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
• A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
• A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
• A new class of efficient and globally convergent conjugate gradient methods in the Dai–Liao family
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice
• A modified conjugate gradient algorithm with backtracking line search technique for large-scale nonlinear equations
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A hybrid scaling parameter for the scaled memoryless BFGS method based on the ℓ_∞ matrix norm
• A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• Some descent three-term conjugate gradient methods and their global convergence
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• A modified BFGS method and its global convergence in nonconvex minimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems