Finite convergence of a subgradient projections method with expanding controls
From MaRDI portal
Publication:649124
DOI10.1007/s00245-011-9139-8zbMath1254.90162OpenAlexW2155541891MaRDI QIDQ649124
Yair Censor, Wei Chen, Homeira Pajoohesh
Publication date: 30 November 2011
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00245-011-9139-8
finite convergenceconvex feasibility problemrepetitive controlexpanding controlsmodified subgradient projectionsquasi-cyclic control
Related Items
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems, Convergence rates for Kaczmarz-type algorithms, Subgradient projectors: extensions, theory, and characterizations, Convergence studies on block iterative algorithms for image reconstruction, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, Finitely convergent iterative methods with overrelaxations revisited, Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy, A generalized projection-based scheme for solving convex constrained optimization problems, Nesterov perturbations and projection methods applied to IMRT, A generalized block-iterative projection method for the common fixed point problem induced by cutters, On the finite convergence of a projected cutter method
Uses Software
Cites Work
- Hilbertian convex feasibility problem: Convergence of projection methods
- A finitely convergent ``row-action method for the convex feasibility problem
- Block-iterative surrogate projection methods for convex feasibility problems
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- Fundamentals of Computerized Tomography
- Efficient controls for finitely convergent sequential algorithms
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- The Relaxation Method for Solving Systems of Linear Inequalities
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Cyclic subgradient projections
- On the Convergence of the Products of Firmly Nonexpansive Mappings
- A relaxation method for reconstructing objects from noisy X-rays
- Iterative oblique projection onto convex sets and the split feasibility problem
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
