Convergence of projection algorithms to approximate solutions of convex feasibility problems
From MaRDI portal
Publication:2906313
Recommendations
- Hilbertian convex feasibility problem: Convergence of projection methods
- Solving for (approximate) convex feasibility under finite precision
- An algorithm for the convex feasibility problem
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- A strongly convergent parallel projection algorithm for convex feasibility problem
Cited in
(11)- Solving for (approximate) convex feasibility under finite precision
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- scientific article; zbMATH DE number 5538161 (Why is no real title available?)
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- scientific article; zbMATH DE number 7213713 (Why is no real title available?)
- An algorithm for the convex feasibility problem
- Finitely convergent iterative methods with overrelaxations revisited
- Linear convergence of projection algorithms
- Asymptotic behavior of two algorithms for solving common fixed point problems
- The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
- Incomplete projection algorithms for solving the convex feasibility problem
This page was built for publication: Convergence of projection algorithms to approximate solutions of convex feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906313)
