A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems
From MaRDI portal
Publication:2015774
DOI10.1155/2013/583710zbMath1291.90177OpenAlexW2031371945WikidataQ58917199 ScholiaQ58917199MaRDI QIDQ2015774
Publication date: 23 June 2014
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/583710
Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
- Iterative methods for mixed equilibrium problems and strictly pseudocontractive mappings
- A viscosity hybrid steepest-descent method for a system of equilibrium and fixed point problems for an infinite family of strictly pseudo-contractive mappings
- An application of hybrid steepest descent methods for equilibrium problems and strict pseudocontractions in Hilbert spaces
- 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
- Algorithms construction for nonexpansive mappings and inverse-strongly monotone mappings
- Generalized systems of variational inequalities and projection methods for inverse-strongly monotone mappings
- A general iterative method for equilibrium problems and strict pseudo-contractions in Hilbert spaces
- A regularization method for the proximal point algorithm
- Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
- A general iterative algorithm for nonexpansive mappings in Hilbert spaces
- Perturbation techniques for nonexpansive mappings with applications
- A multiprojection algorithm using Bregman projections in a product space
- Convergence of generalized proximal point algorithms
- Viscosity approximation methods for nonexpansive mappings
- A unified implicit algorithm for solving the triple-hierarchical constrained optimization problem
- Two-step projection methods for a system of variational inequality problems in Banach spaces
- Viscosity approximation methods for fixed-points problems
- A general iterative method for nonexpansive mappings in Hilbert spaces
- An iterative scheme for equilibrium problems and fixed point problems of strict pseudo-contraction mappings
- Three Strong Convergence Theorems Regarding Iterative Methods for Solving Equilibrium Problems in Reflexive Banach Spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- CONVERGENCE ANALYSIS ON HYBRID PROJECTION ALGORITHMS FOR EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- 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
- A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces
