Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
Publication:860662
DOI10.1016/J.JMAA.2006.05.010zbMath1253.90211OpenAlexW2044040638MaRDI QIDQ860662
Yair Censor, Alexander Segal, Avi Motova
Publication date: 9 January 2007
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2006.05.010
proximity functionCQ-algorithmsubgradient projectionsaveraged operatorsmultiple-sets split feasibilityperturbed projections
Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items (only showing first 100 items - show all)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A projection algorithm for general variational inequalities with perturbed constraint sets
- Averaged mappings in the Hilbert ball
- A multiprojection algorithm using Bregman projections in a product space
- On variable-step relaxed projection algorithm for variational inequalities
- Some developments in general variational inequalities
- Extrapolation algorithm for affine-convex feasibility problems
- The multiple-sets split feasibility problem and its applications for inverse problems
- Projection methods for the linear split feasibility problems
- A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets
- Decomposition through formalization in a product space
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Cyclic subgradient projections
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Generalized KM theorems and their applications
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
This page was built for publication: Perturbed projections and subgradient projections for the multiple-sets split feasibility problem