New iterative methods for equilibrium and constrained convex minimization problems
From MaRDI portal
Publication:4966679
DOI10.1142/S1793557119500426WikidataQ130013302 ScholiaQ130013302MaRDI QIDQ4966679
Publication date: 27 June 2019
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
A Hybrid Viscosity Approximation Method for a Common Solution of a General System of Variational Inequalities, an Equilibrium Problem, and Fixed Point Problems ⋮ A new iterative method for generalized equilibrium and constrained convex minimization problems ⋮ A modified Halpern algorithm for approximating a common solution of split equality convex minimization problem and fixed point problem in uniformly convex Banach spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
- Averaged mappings and the gradient-projection algorithm
- An iterative approach to quadratic optimization
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Strong convergence of a new composite iterative method for equilibrium problems and fixed point problems
- A general iterative method for nonexpansive mappings in Hilbert spaces
- Approximation of common fixed points of a countable family of nonexpansive mappings in a Banach space
- Iterative algorithm by using the hybrid method in mathematical programming for solving variational inequality problems and equilibrium 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
- An ε-equilibrium point in ann-person game with constraints
This page was built for publication: New iterative methods for equilibrium and constrained convex minimization problems
