Projection algorithms for convex feasibility problem
From MaRDI portal
Publication:4931987
zbMATH Open1207.68423MaRDI QIDQ4931987FDOQ4931987
Publication date: 1 October 2010
Recommendations
- The relation between the weight factor and the number of steps in a projection algorithm
- An algorithm for the convex feasibility problem
- Incomplete projection algorithms for solving the convex feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (12)
- Title not available (Why is that?)
- Projection algorithms for linear programming
- A finite steps algorithm for solving convex feasibility problems
- An algorithm for the convex feasibility problem
- Title not available (Why is that?)
- Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
- A Projection-Based Algorithm for Consistent and Inconsistent Constraints
- The Projective SUMT Method for Convex Programming
- Projection Methods in Conic Optimization
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- Incomplete projection algorithms for solving the convex feasibility problem
- Low-complexity constrained affine-projection algorithms
This page was built for publication: Projection algorithms for convex feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931987)
