A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces
From MaRDI portal
Publication:1760833
DOI10.1155/2012/782960zbMath1252.49013WikidataQ58907340 ScholiaQ58907340MaRDI QIDQ1760833
Publication date: 15 November 2012
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/782960
variational inequality; gradient-projection algorithm; constrained convex minimization problems; averaged mappings in Hilbert spaces
90C30: Nonlinear programming
49J40: Variational inequalities
47J25: Iterative procedures involving nonlinear operators
49J45: Methods involving semicontinuity and convergence; relaxation
74B99: Elastic materials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Averaged mappings and the gradient-projection algorithm
- A general iterative method for an infinite family of nonexpansive mappings
- A general iterative algorithm for nonexpansive mappings in Hilbert spaces
- A hybrid approximation method for equilibrium and fixed point problems for a monotone mapping and a nonexpansive mapping
- Strong convergence of composite iterative methods for equilibrium problems and fixed point problems
- A new hybrid iterative method for solution of equilibrium problems and fixed point problems for an inverse strongly monotone operator and a nonexpansive mapping
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications
- Iterative Algorithms for Nonlinear Operators
- Projected gradient methods for linearly constrained problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Solving monotone inclusions via compositions of nonexpansive averaged operators
