Several inertial methods for solving split convex feasibilities and related problems
From MaRDI portal
Publication:2180876
In this paper, the authors investigate the common solution problem of equilibrium and split convex feasibility problems. Both the problems provide a general framework of for many real applications, such as signal and imaging, intensity-modulated radiation therapy, etc. A strong convergence theorem is established in real Hilbert spaces. Numerical experiments are also done for supporting the performances of the proposed methods.
Recommendations
- An inertial extragradient algorithm for split problems in Hilbert spaces
- A new inertial self-adaptive algorithm for split common fixed-point problems
- An inertial method for split common fixed point problems in Hilbert spaces
- An inertial method for solving split common fixed point problems
- Inertial viscosity-type algorithms for a class of split feasibility problems and fixed point problems in Hilbert spaces
Cites work
- \(l_1\)-\(l_2\) regularization of split feasibility problems
- A fixed point method for solving a split feasibility problem in Hilbert spaces
- A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An algorithm for a class of split feasibility problems: application to a model in electricity production
- An extragradient method for solving split feasibility and fixed point problems
- An iterative method for common solutions of equilibrium problems and hierarchical fixed point problems
- An iterative method for solving split monotone variational inclusion and fixed point problems
- An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping
- Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
- Convergence theorems for inertial KM-type algorithms
- Equilibrium problems and variational models. Based on the meeting, Erice, Italy, June 23--July 2, 2000
- Equilibrium programming using proximal-like algorithms
- Extragradient methods for split feasibility problems and generalized equilibrium problems in Banach spaces
- 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 1090020 (Why is no real title available?)
- scientific article; zbMATH DE number 1949156 (Why is no real title available?)
- scientific article; zbMATH DE number 204196 (Why is no real title available?)
- scientific article; zbMATH DE number 3208857 (Why is no real title available?)
- scientific article; zbMATH DE number 3235902 (Why is no real title available?)
- Inertial accelerated algorithms for solving a split feasibility problem
- Iterative algorithms for hierarchical fixed points problems and variational inequalities
- 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
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Shrinking projection methods involving inertial forward-backward splitting methods for inclusion problems
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Split feasibility and fixed point problems
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- The relaxed CQ algorithm solving the split feasibility problem
- Weak convergence theorem for finding fixed points and solution of split feasibility and systems of equilibrium problems
Cited in
(9)- Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
- Linear approximation method for solving split inverse problems and its applications
- Global and linear convergence of alternated inertial methods for split feasibility problems
- Inertial accelerated algorithms for solving a split feasibility problem
- Two inertial-type algorithms for solving the split feasibility problem
- Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces
- Relaxed double inertial Tseng's extragradient method for solving non-Lipschitz split monotone variational inclusion problems with fixed point constraints
- CQ algorithm with inertial and correction terms for split feasibility problems
- Prediction of Breast Cancer through Fast Optimization Techniques Applied to Machine Learning
This page was built for publication: Several inertial methods for solving split convex feasibilities and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180876)
