A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
From MaRDI portal
Publication:2472373
DOI10.1016/J.LAA.2006.11.009zbMath1195.92036OpenAlexW2073749939WikidataQ43183168 ScholiaQ43183168MaRDI QIDQ2472373
Publication date: 21 February 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc2346447
Medical applications (general) (92C50) Software, source code, etc. for problems pertaining to biology (92-04)
Related Items (13)
A non-interior continuation algorithm for solving the convex feasibility problem ⋮ Stochastic block projection algorithms with extrapolation for convex feasibility problems ⋮ Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Finite convergence of a subgradient projections method with expanding controls ⋮ A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem ⋮ Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections ⋮ New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ Linear Convergence of Projection Algorithms ⋮ ART3+ ⋮ Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates ⋮ Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
Cites Work
This page was built for publication: A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
