Projection methods for the linear split feasibility problems

DOI10.1080/02331930601124971MaRDI QIDQ3514829zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

split feasibility problemprojection methodsFejér monotonicity propertyprojected surrogate constraints method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05)

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

Cites work

• scientific article; zbMATH DE number 447429 (Why is no real title available?)
• A generalization of the Opial's theorem
• A method of projection onto an acute cone with level control in convex minimization
• A multiprojection algorithm using Bregman projections in a product space
• A simultaneous projections method for linear inequalities
• An interior points algorithm for the convex feasibility problem
• Block-iterative surrogate projection methods for convex feasibility problems
• Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
• Iterative oblique projection onto convex sets and the split feasibility problem
• Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
• New iterative methods for linear inequalities
• Obtuse cones and Gram matrices with non-negative inverse
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Relaxed outer projections, weighted averages and convex feasibility
• Residual Selection in A Projection Method for Convex Minimization Problems
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Selection strategies in projection methods for convex minimization problems
• Surrogate methods for linear inequalities
• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
• Topological proofs for certain theorems on matrices with non-negative elements

Cited in

(5)

• Convergence of the projected surrogate constraints method for the linear split feasibility problems
• Iterative method for solving the linear feasibility problem
• Projection methods for solving split equilibrium problems
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• General algorithms for split common fixed point problem of demicontractive mappings

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)