An algorithm for the convex feasibility problem
From MaRDI portal
Recommendations
- On Projection Algorithms for Solving Convex Feasibility Problems
- A strongly convergent parallel projection algorithm for convex feasibility problem
- Projection algorithms for convex feasibility problem
- Convergence of projection algorithms to approximate solutions of convex feasibility problems
- scientific article; zbMATH DE number 6263278
Cited in
(16)- About convergence of scalable algorithm of construction pseudoprojection on convex closed set
- scientific article; zbMATH DE number 6263278 (Why is no real title available?)
- A finite steps algorithm for solving convex feasibility problems
- A non-interior continuation algorithm for solving the convex feasibility problem
- Linear convergence of projection algorithms
- Projection algorithms: Results and open problems
- Projection algorithms for convex feasibility problem
- Iterative algorithm for solving a class of convex feasibility problem
- scientific article; zbMATH DE number 2227334 (Why is no real title available?)
- An algorithm for maximizing a convex function over a simple set
- Note: An algorithm to solve polyhedral convex set optimization problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convergence of projection algorithms to approximate solutions of convex feasibility problems
- scientific article; zbMATH DE number 6451396 (Why is no real title available?)
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- Solving for (approximate) convex feasibility under finite precision
This page was built for publication: An algorithm for the convex feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3538466)
