Two spectral gradient projection methods for constrained equations and their linear convergence rate
DOI10.1186/s13660-014-0525-zzbMath1310.65066OpenAlexW2138601654WikidataQ59436240 ScholiaQ59436240MaRDI QIDQ2260602
Publication date: 11 March 2015
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-014-0525-z
unconstrained optimizationglobal convergenceerror boundprojection methodspectral gradient methodnumerical resultconstrained equationslarge-scale constrained equations
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items (11)
Uses Software
Cites Work
- Unnamed Item
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
- A methodology for solving chemical equilibrium systems
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Three derivative-free projection methods for nonlinear equations with convex constraints
- A projection method for a system of nonlinear monotone equations with convex constraints
- R-linear convergence of the Barzilai and Borwein gradient method
- Two-Point Step Size Gradient Methods
- A NEW PROJECTION ALGORITHM FOR SOLVING A SYSTEM OF NONLINEAR EQUATIONS WITH CONVEX CONSTRAINTS
- Function minimization by conjugate gradients
This page was built for publication: Two spectral gradient projection methods for constrained equations and their linear convergence rate