Iterative methods for constrained convex minimization problem in Hilbert spaces
From MaRDI portal
Publication:2249114
DOI10.1186/1687-1812-2013-105zbMath1292.58013OpenAlexW2163579744WikidataQ59301555 ScholiaQ59301555MaRDI QIDQ2249114
Publication date: 8 July 2014
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1687-1812-2013-105
iterative algorithmfixed pointvariational inequalitynonexpansive mappingconstrained convex minimization
Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Variational inequalities (global problems) in infinite-dimensional spaces (58E35) Numerical solutions to equations with nonlinear operators (65J15)
Related Items
Stochastic approximation results for variational inequality problem using random-type iterative schemes ⋮ Iterative approximation of solutions for constrained convex minimization problem ⋮ The common solution for a generalized equilibrium problem, a variational inequality problem and a hierarchical fixed point problem ⋮ An iterative algorithm for fixed point problem and convex minimization problem with applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general composite iterative method for generalized mixed equilibrium problems, variational inequality problems and optimization problems
- A new iterative algorithm for solving common solutions of generalized mixed equilibrium problems, fixed point problems and variational inclusion problems with minimization problems
- A general iterative approach to variational inequality problems and optimization problems
- A viscosity of Cesàro mean approximation methods for a mixed equilibrium, variational inequalities, and fixed point problems
- Averaged mappings and the gradient-projection algorithm
- A new modified hybrid steepest-descent by using a viscosity approximation method with a weakly contractive mapping for a system of equilibrium problems and fixed point problems with minimization problems
- A hybrid extragradient viscosity approximation method for solving equilibrium problems and fixed point problems of infinitely many nonexpansive mappings
- A multiprojection algorithm using Bregman projections in a product space
- An alternating projection that does not converge in norm
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- 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
- Projected gradient methods for linearly constrained problems
- Projection methods for variational inequalities with application to the traffic assignment problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- On Projection Algorithms for Solving Convex Feasibility Problems
