A modified nonlinear conjugate gradient method with the Armijo line search and its application

DOI10.1155/2020/6210965MaRDI QIDQ2007123zbMATH OpenOpenAlexFDO

Authors Mengxiang Zhang, Yingjie Zhou, Songhua Wang

Publication date 12 October 2020

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Review text

Summary: In this article, a modified Polak-Ribière-Polyak (PRP) conjugate gradient method is proposed for image restoration. The presented method can generate sufficient descent directions without any line search conditions. Under some mild conditions, this method is globally convergent with the Armijo line search. Moreover, the linear convergence rate of the modified PRP method is established. The experimental results of unconstrained optimization, image restoration, and compressive sensing show that the proposed method is promising and competitive with other conjugate gradient methods.

Recommendations

• A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to 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
• Global convergence of a modified PRP conjugate gradient method
• scientific article; zbMATH DE number 6795872
• A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems

Cites work

• A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
• A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
• A descent spectral conjugate gradient method for impulse noise removal
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A nonmonotone conjugate gradient algorithm for unconstrained optimization
• A survey of nonlinear conjugate gradient methods
• A Two-Term PRP-Based Descent Method
• Analysis of a self-scaling quasi-Newton method
• CUTE
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Efficient generalized conjugate gradient algorithms. I: Theory
• Efficient hybrid conjugate gradient techniques
• Function minimization by conjugate gradients
• Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search
• Global convergence of some modified PRP nonlinear conjugate gradient methods
• Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Global convergence result for conjugate gradient methods
• scientific article; zbMATH DE number 3843083 (Why is no real title available?)
• scientific article; zbMATH DE number 3687182 (Why is no real title available?)
• scientific article; zbMATH DE number 3526471 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• Methods of conjugate gradients for solving linear systems
• New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
• Some sufficient descent conjugate gradient methods and their global convergence
• Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
• Testing Unconstrained Optimization Software
• The conjugate gradient method in extremal problems
• The convergence properties of some new conjugate gradient methods
• The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
• The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems

Cited in

(6)

• A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization 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 adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
• A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems
• A convex combination between two different search directions of conjugate gradient method and application in image restoration
• Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search

Describes a project that uses

Uses Software

• CUTE
• CUTEr
• minpack

This page was built for publication: A modified nonlinear conjugate gradient method with the Armijo line search and its application

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