A scaled conjugate gradient method for solving monotone nonlinear equations with convex constraints
From MaRDI portal
Publication:1789832
DOI10.1155/2013/286486zbMath1397.90365OpenAlexW2076248199WikidataQ59002598 ScholiaQ59002598MaRDI QIDQ1789832
Publication date: 10 October 2018
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/286486
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Methods of quasi-Newton type (90C53)
Related Items (6)
A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration ⋮ A scaled derivative-free projection method for solving nonlinear monotone equations ⋮ A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications ⋮ Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring ⋮ A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications ⋮ Self adaptive spectral conjugate gradient method for solving nonlinear monotone equations
This page was built for publication: A scaled conjugate gradient method for solving monotone nonlinear equations with convex constraints
