Finite convergence of a subgradient projections method with expanding controls
From MaRDI portal
Publication:649124
Recommendations
- A finitely convergent ``row-action method for the convex feasibility problem
- Publication:3028739
- On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
- An acceleration scheme for cyclic subgradient projections method
- On finitely convergent iterative methods for the convex feasibility problem
Cites work
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 3232960 (Why is no real title available?)
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- A finitely convergent ``row-action method for the convex feasibility problem
- A relaxation method for reconstructing objects from noisy X-rays
- Block-iterative surrogate projection methods for convex feasibility problems
- Cyclic subgradient projections
- Efficient controls for finitely convergent sequential algorithms
- Fundamentals of Computerized Tomography
- Generalized relaxations of nonexpansive operators and convex feasibility problems
- Hilbertian convex feasibility problem: Convergence of projection methods
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the Convergence of the Products of Firmly Nonexpansive Mappings
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- The Relaxation Method for Solving Systems of Linear Inequalities
Cited in
(13)- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Subgradient projectors: extensions, theory, and characterizations
- Nesterov perturbations and projection methods applied to IMRT
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- A finitely convergent circumcenter method for the convex feasibility problem
- A generalized projection-based scheme for solving convex constrained optimization problems
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- Convergence studies on block iterative algorithms for image reconstruction
- A finitely convergent ``row-action method for the convex feasibility problem
- Finitely convergent iterative methods with overrelaxations revisited
- On the finite convergence of a projected cutter method
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- Convergence rates for Kaczmarz-type algorithms
This page was built for publication: Finite convergence of a subgradient projections method with expanding controls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649124)
