A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
From MaRDI portal
Publication:2836086
DOI10.1080/02331934.2016.1193738zbMath1384.90119OpenAlexW2515347265MaRDI QIDQ2836086
Publication date: 7 December 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1193738
fixed pointvariational inequalityequilibriumregularization methodsconstrained convex minimizationgeneral iterative algorithms
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48)
Related Items
Cites Work
- 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
- Averaged mappings and the gradient-projection algorithm
- Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
- A general iterative algorithm for nonexpansive mappings in Hilbert spaces
- 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 nonexpansive mappings
- 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
- Strong convergence of the CQ method for fixed point iteration processes
- 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
- A note on the CQ algorithm for the split feasibility problem
