Implicit and explicit algorithms for solving the split feasibility problem
From MaRDI portal
Publication:694181
DOI10.1007/S11590-011-0340-0zbMATH Open1281.90087OpenAlexW2079364432MaRDI QIDQ694181FDOQ694181
Authors: Xin Yu, Nazeer Shahzad, Yonghong Yao 
Publication date: 11 December 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0340-0
Recommendations
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- Relaxed implicit extragradient-like methods for finding minimum-norm solutions of the split feasibility problem
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Two strongly convergent CQ algorithms for split feasibility problem
- Strong convergence theorems for a nonexpansive mapping and its applications for solving the split feasibility problem
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
- Iterative oblique projection onto convex sets and the split feasibility problem
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- Strong convergence of the CQ method for fixed point iteration processes
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- Iterative Algorithms for Nonlinear Operators
- Encyclopedia of Optimization
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
- Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Strong convergence of modified Mann iterations for asymptotically nonexpansive mappings and semigroups
- A hybrid algorithm for pseudo-contractive mappings
- Optimization and optimal control. Theory and applications
- Hybrid methods for a class of monotone variational inequalities
Cited In (33)
- Ball-relaxed projection algorithms for multiple-sets split feasibility problem
- New algorithms designed for the split common fixed point problem of quasi-pseudocontractions
- Optimization for Inconsistent Split Feasibility Problems
- Regularized methods for the split feasibility problem
- On bilevel split pseudomonotone variational inequality problems with applications
- A new iterative algorithm for split solution problems of quasi-nonexpansive mappings
- Algorithmic and analytical approach to the split common fixed points problem
- Extra-gradient methods for solving split feasibility and fixed point problems
- Improvised divide and conquer approach for the LIS problem
- Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications
- Two inertial-type algorithms for solving the split feasibility problem
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- On descent-projection method for solving the split feasibility problems
- A new computational technique for common solutions between systems of generalized mixed equilibrium and fixed point problems
- Two relaxed CQ methods for the split feasibility problem with multiple output sets
- Viscosity self-adaptive method for generalized split system of variational inclusion problem
- A note on approximating curve with 1-norm regularization method for the split feasibility problem
- Linesearch methods for bilevel split pseudomonotone variational inequality problems
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
- Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
- Weak convergence theorem for finding fixed points and solution of split feasibility and systems of equilibrium problems
- A strongly convergent method for the split feasibility problem
- An inertial extrapolation method for multiple-set split feasibility problem
- Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces
- A parallel algorithm for generalized multiple-set split feasibility with application to optimal control problems
- Generalized extragradient iterative methods for solving split feasibility and fixed point problems in Hilbert spaces
- The constrained multiple-sets split feasibility problem and its projection algorithms
- Title not available (Why is that?)
- An MM Algorithm for Split Feasibility Problems
This page was built for publication: Implicit and explicit algorithms for solving the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694181)
