A finitely convergent ``row-action method for the convex feasibility problem
From MaRDI portal
Recommendations
- Publication:3028739
- A row-action method for convex programming
- Finite convergence of a subgradient projections method with expanding controls
- A parallel subgradient projections method for the convex feasibility problem
- Block-iterative subgradient projection algorithms for the convex feasibility problem
Cites work
- scientific article; zbMATH DE number 3232960 (Why is no real title available?)
- A primal-dual projection method for solving systems of linear inequalities
- Cyclic subgradient projections
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
- The Relaxation Method for Linear Inequalities
- The method of projections for finding the common point of convex sets
Cited in
(24)- Asymptotically optimal row-action methods for generalized least squares problems
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Finite convergence of a subgradient projections method with expanding controls
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- A row-action method for convex programming
- Relaxed outer projections, weighted averages and convex feasibility
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- Nesterov perturbations and projection methods applied to IMRT
- Weak, strong, and linear convergence of a double-layer fixed point algorithm
- A finitely convergent circumcenter method for the convex feasibility problem
- A method for approximating the solution set of a system of convex inequalities by polytopes
- A generalized projection-based scheme for solving convex constrained optimization problems
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- scientific article; zbMATH DE number 4016617 (Why is no real title available?)
- Finitely convergent iterative methods with overrelaxations revisited
- Generalization: One technique of computational and applied mathematical methodology
- Primal-dual row-action method for convex programming
- On the finite convergence of a projected cutter method
- Linear convergence of subgradient algorithm for convex feasibility on Riemannian manifolds
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- The direct-projection methods
- Hilbertian convex feasibility problem: Convergence of projection methods
This page was built for publication: A finitely convergent ``row-action method for the convex feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109529)
