A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems
DOI10.1155/2013/583710zbMATH Open1291.90177OpenAlexW2031371945WikidataQ58917199 ScholiaQ58917199MaRDI QIDQ2015774FDOQ2015774
Authors: Ming Tian
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
Recommendations
- General iterative scheme based on the regularization for solving a constrained convex minimization problem
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
- An iterative method for equilibrium and constrained convex minimization problems
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
- Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem
Numerical mathematical programming methods (65K05) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative procedures involving nonlinear operators (47J25)
Cites Work
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- 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
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Title not available (Why is that?)
- Projected gradient methods for linearly constrained problems
- Title not available (Why is that?)
- 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
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Title not available (Why is that?)
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces
- Averaged mappings and the gradient-projection algorithm
- Algorithms construction for nonexpansive mappings and inverse-strongly monotone mappings
- 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
- Convergence of generalized proximal point algorithms
- Title not available (Why is that?)
- A general iterative method for equilibrium problems and strict pseudo-contractions 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
- A viscosity hybrid steepest-descent method for a system of equilibrium and fixed point problems for an infinite family of strictly pseudo-contractive mappings
- Title not available (Why is that?)
- An application of hybrid steepest descent methods for equilibrium problems and strict pseudocontractions in Hilbert spaces
- Title not available (Why is that?)
- Perturbation techniques for nonexpansive mappings with applications
- CONVERGENCE ANALYSIS ON HYBRID PROJECTION ALGORITHMS FOR EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS
- An explicit method for systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings
- 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
- Generalized systems of variational inequalities and projection methods for inverse-strongly monotone mappings
Cited In (2)
This page was built for publication: A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015774)