Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems

DOI10.1155/2020/7859286zbMath1459.90170OpenAlexW3092726245WikidataQ113078496 ScholiaQ113078496MaRDI QIDQ2209686

Yan Li, Yulun Wu, Mengxiang Zhang

Publication date: 4 November 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/7859286

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Methods of reduced gradient type (90C52)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short note on the global convergence of the unmodified PRP method
• Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search
• Convergence analysis of a modified BFGS method on convex minimizations
• The convergence properties of some new conjugate gradient methods
• Efficient generalized conjugate gradient algorithms. I: Theory
• A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
• Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
• A globally convergent version of the Polak-Ribière conjugate gradient method
• A PRP-based residual method for large-scale monotone nonlinear equations
• A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
• Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
• The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
• The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• Some sufficient descent conjugate gradient methods and their global convergence
• On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
• A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
• Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Function minimization by conjugate gradients
• Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• New properties of a nonlinear conjugate gradient method
• Benchmarking optimization software with performance profiles.