Finite convergence of a subgradient projections method with expanding controls
From MaRDI portal
Publication:649124
DOI10.1007/S00245-011-9139-8zbMATH Open1254.90162OpenAlexW2155541891MaRDI QIDQ649124FDOQ649124
Yair Censor, Wei Chen, H. 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
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
convex feasibility problemfinite convergencerepetitive controlexpanding controlsmodified subgradient projectionsquasi-cyclic control
Cites Work
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- Fundamentals of Computerized Tomography
- On Projection Algorithms for Solving Convex Feasibility Problems
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Iterative oblique projection onto convex sets and the split feasibility problem
- Title not available (Why is that?)
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Hilbertian convex feasibility problem: Convergence of projection methods
- Title not available (Why is that?)
- Cyclic subgradient projections
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- A finitely convergent ``row-action method for the convex feasibility problem
- On the Convergence of the Products of Firmly Nonexpansive Mappings
- Efficient controls for finitely convergent sequential algorithms
- The Relaxation Method for Solving Systems of Linear Inequalities
- Block-iterative surrogate projection methods for convex feasibility problems
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- A relaxation method for reconstructing objects from noisy X-rays
- Title not available (Why is that?)
Cited In (13)
- A generalized projection-based scheme for solving convex constrained optimization problems
- On the finite convergence of a projected cutter method
- Subgradient projectors: extensions, theory, and characterizations
- Nesterov perturbations and projection methods applied to IMRT
- A finitely convergent circumcenter method for the convex feasibility problem
- Finitely convergent iterative methods with overrelaxations revisited
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- Convergence rates for Kaczmarz-type algorithms
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- Convergence studies on block iterative algorithms for image reconstruction
- A finitely convergent ``row-action method for the convex feasibility problem
Uses Software
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)
