Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
DOI10.1186/s13663-015-0258-9zbMath1309.47084WikidataQ59436072 ScholiaQ59436072MaRDI QIDQ2017669
Publication date: 23 March 2015
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13663-015-0258-9
resolvent; strong convergence; fixed point; variational inequality; iterative method; maximal monotone operator; equilibrium problem; constrained convex minimization
47J25: Iterative procedures involving nonlinear operators
47H09: Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc.
58E35: Variational inequalities (global problems) in infinite-dimensional spaces
65J15: Numerical solutions to equations with nonlinear operators
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general iterative method for hierarchical variational inequality problems in Hilbert spaces and applications
- Extragradient-projection method for solving constrained convex minimization problems
- An explicit method for systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces
- Averaged mappings and the gradient-projection algorithm
- Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
- Strong and weak convergence theorems for common solutions of generalized equilibrium problems and zeros of maximal monotone operators
- A multiprojection algorithm using Bregman projections in a product space
- Equilibrium programming using proximal-like algorithms
- An alternating projection that does not converge in norm
- Viscosity approximation methods for fixed-points problems
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- A general iterative method for nonexpansive mappings in Hilbert spaces
- Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Solving the split feasibility problem without prior knowledge of matrix norms
- CONVERGENCE ANALYSIS ON HYBRID PROJECTION ALGORITHMS FOR EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- Generalized KM theorems and their applications
- General iterative methods for equilibrium and constrained convex minimization problem
- A note on the CQ algorithm for the split feasibility problem