Projection methods for the linear split feasibility problems
DOI10.1080/02331930601124971zbMATH Open1148.65037OpenAlexW2073088382MaRDI QIDQ3514829FDOQ3514829
Authors: Andrzej Cegielski 
Publication date: 23 July 2008
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930601124971
Recommendations
- Projection algorithm for split feasibility problem
- Convergence of the projected surrogate constraints method for the linear split feasibility problems
- A new iterative method for the split feasibility problem
- A new halfspace-relaxation projection method for the split feasibility problem
- A splitting-relaxed projection method for solving the split feasibility problem
split feasibility problemprojection methodsFejér monotonicity propertyprojected surrogate constraints method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05)
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- A multiprojection algorithm using Bregman projections in a product space
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Iterative oblique projection onto convex sets and the split feasibility problem
- Topological proofs for certain theorems on matrices with non-negative elements
- Relaxed outer projections, weighted averages and convex feasibility
- An interior points algorithm for the convex feasibility problem
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- A method of projection onto an acute cone with level control in convex minimization
- Residual Selection in A Projection Method for Convex Minimization Problems
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
- Obtuse cones and Gram matrices with non-negative inverse
- Block-iterative surrogate projection methods for convex feasibility problems
- A simultaneous projections method for linear inequalities
- Selection strategies in projection methods for convex minimization problems
- New iterative methods for linear inequalities
- Surrogate methods for linear inequalities
- A generalization of the Opial's theorem
- Title not available (Why is that?)
Cited In (5)
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Convergence of the projected surrogate constraints method for the linear split feasibility problems
- General algorithms for split common fixed point problem of demicontractive mappings
- Projection methods for solving split equilibrium problems
- Iterative method for solving the linear feasibility problem
This page was built for publication: Projection methods for the linear split feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514829)
