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

DOI10.1016/J.LAA.2006.11.009zbMATH Open1195.92036OpenAlexW2073749939WikidataQ43183168 ScholiaQ43183168MaRDI QIDQ2472373FDOQ2472373

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

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

zbMATH Keywords

intensity-modulated radiation therapylinear feasibility problemalgebraic reconstruction techniques

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Relaxation Method for Linear Inequalities
• Title not available (Why is that?)
• A relaxation method for reconstructing objects from noisy X-rays

Cited In (17)

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

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)