A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy

DOI10.1016/J.LAA.2006.11.009MaRDI QIDQ2472373zbMATH OpenOpenAlexWikidataFDO

Authors Gabor T. Herman, Wei Chen

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

zbMATH Keywords

algebraic reconstruction techniquesintensity-modulated radiation therapylinear feasibility problem

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to biology (92-04) Medical applications (general) (92C50)

Recommendations

• Dose-based constraint generation for large-scale IMRT optimization
• A computational solution of the inverse problem in radiation-therapy treatment planning
• On linear infeasibility arising in intensity-modulated radiation therapy inverse planning
• Minimal changes in the right hand side data for correcting linear infeasibility arising in intensity-modulated radiation therapy with the generalized Newton method
• A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems

Cites work

• A relaxation method for reconstructing objects from noisy X-rays
• scientific article; zbMATH DE number 3856876 (Why is no real title available?)
• scientific article; zbMATH DE number 1382772 (Why is no real title available?)
• The Relaxation Method for Linear Inequalities

Cited in

(17)

• A non-interior continuation algorithm for solving the convex feasibility problem
• Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
• Minimal changes in the right hand side data for correcting linear infeasibility arising in intensity-modulated radiation therapy with the generalized Newton method
• Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
• Geometric Algorithms for the Constrained 1-D K-Means Clustering Problems and IMRT Applications
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
• A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
• Stochastic block projection algorithms with extrapolation for convex feasibility problems
• Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy
• New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
• Linear convergence of projection algorithms
• Randomized projection methods for convex feasibility: conditioning and convergence rates
• ART3+
• Computing and Combinatorics
• Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
• Finite convergence of a subgradient projections method with expanding controls
• A generalized projection-based scheme for solving convex constrained optimization problems

This page was built for publication: A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472373)