A unified iterative treatment for solutions of problems of split feasibility and equilibrium in Hilbert spaces
Summary: We at first raise the so called split feasibility fixed point problem which covers the problems of split feasibility, convex feasibility, and equilibrium as special cases and then give two types of algorithms for finding solutions of this problem and establish the corresponding strong convergence theorems for the sequences generated by our algorithms. As a consequence, we apply them to study the split feasibility problem, the zero point problem of maximal monotone operators, and the equilibrium problem and to show that the unique minimum norm solutions of these problems can be obtained through our algorithms. Since the variational inequalities, convex differentiable optimization, and Nash equilibria in noncooperative games can be formulated as equilibrium problems, each type of our algorithms can be considered as a generalized methodology for solving the aforementioned problems.
- The general iterative methods for a split feasibility problem and a mixed equilibrium problem in a Hilbert space
- Iterative algorithm for a family of split equilibrium problems and fixed point problems in Hilbert spaces with applications
- Iterative methods for generalized split feasibility problems in Hilbert spaces
- A new iterative algorithm for generalized split equilibrium problem in Hilbert spaces
- Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces
- Iterative algorithms for solving the split feasibility problem in Hilbert spaces
- A fixed point method for solving a split feasibility problem in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative algorithm for a split equilibrium problem and fixed problem for finite asymptotically nonexpansive mappings in Hilbert space
- Viscosity iteration methods for a split feasibility problem and a mixed equilibrium problem in a Hilbert space
- A multiprojection algorithm using Bregman projections in a product space
- A note on the multiple-set split convex feasibility problem in Hilbert space
- A proximal point algorithm converging strongly for general errors
- A regularization method for the proximal point algorithm
- A strongly convergent method for the split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Approximating common fixed points of averaged self-mappings with applications to the split feasibility problem and maximal monotone operators in Hilbert spaces
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Approximating solutions of maximal monotone operators in Hilbert spaces
- Convergence of generalized proximal point algorithms
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Four parameter proximal point algorithms
- scientific article; zbMATH DE number 5305574 (Why is no real title available?)
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 3595777 (Why is no real title available?)
- scientific article; zbMATH DE number 3615396 (Why is no real title available?)
- scientific article; zbMATH DE number 1090020 (Why is no real title available?)
- scientific article; zbMATH DE number 2182576 (Why is no real title available?)
- Inexact Halpern-type proximal point algorithm
- Iterative Algorithms for Nonlinear Operators
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Monotone Operators and the Proximal Point Algorithm
- On the contraction-proximal point algorithms with multi-parameters
- Regularized methods for the split feasibility problem
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces
- A strong convergence algorithm for the two-operator split common fixed point problem in Hilbert spaces
- Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
- Iteration process for fixed point problems and zeros of maximal monotone operators
- scientific article; zbMATH DE number 6897305 (Why is no real title available?)
- A unified scheme for solving split inclusions with applications
This page was built for publication: A unified iterative treatment for solutions of problems of split feasibility and equilibrium in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2318890)
