Two optimal Hager-Zhang conjugate gradient methods for solving monotone nonlinear equations

DOI10.1016/j.apnum.2020.02.017OpenAlexW3009353158MaRDI QIDQ1986155

Abdullah Shah, Jamilu Sabi'u, Mohammed Yusuf Waziri

Publication date: 7 April 2020

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2020.02.017

zbMATH Keywords

condition numberprojection methodsingular valuemonotone nonlinear equations

Mathematics Subject Classification ID

Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Related Items (17)

Solving nonlinear monotone operator equations via modified SR1 update ⋮ A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems ⋮ A modified Hager-Zhang conjugate gradient method with optimal choices for solving monotone nonlinear equations ⋮ A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration ⋮ A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations ⋮ A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications ⋮ Modified Dai-Zuan iterative scheme for nonlinear systems and its application ⋮ Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring ⋮ A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing ⋮ A globally convergent derivative-free projection method for nonlinear monotone equations with applications ⋮ A derivative-free \textit{RMIL} conjugate gradient projection method for convex constrained nonlinear monotone equations with applications in compressive sensing ⋮ Modified Hager–Zhang conjugate gradient methods via singular value analysis for solving monotone nonlinear equations with convex constraint ⋮ Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations ⋮ Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application ⋮ A modified PRP-type conjugate gradient projection algorithm for solving large-scale monotone nonlinear equations with convex constraint ⋮ A family of inertial-relaxed DFPM-based algorithms for solving large-scale monotone nonlinear equations with application to sparse signal restoration ⋮ Modified optimal Perry conjugate gradient method for solving system of monotone equations with applications

Uses Software

• CG_DESCENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the sufficient descent condition of the Hager-Zhang conjugate gradient methods
• Two new conjugate gradient methods based on modified secant equations
• Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
• A family of Hager-Zhang conjugate gradient methods for system of monotone nonlinear equations
• Optimization theory and methods. Nonlinear programming
• A globally convergent BFGS method for nonlinear monotone equations without any merit functions
• Algorithm 851
• 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
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• 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 optimal Hager-Zhang conjugate gradient methods for solving monotone nonlinear equations