On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
From MaRDI portal
Publication:3799576
DOI10.1088/0266-5611/4/3/006zbMath0653.65049OpenAlexW2076310535MaRDI QIDQ3799576
Martin D. Altschuler, William D. Powlis, Yair Censor
Publication date: 1988
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c03b65023d80d65e5d4453980da90dd110d74de4
discretizationinverse problemradiation therapysystem of linear inequalitiesforward problemfeasible solutionsCimmina's algorithmcomputerized inversion of data
Numerical mathematical programming methods (65K05) Linear programming (90C05) Medical applications (general) (92C50)
Related Items
Iterative prescription refinement in fully discretized inverse problems of radiation therapy planning, Fast simultaneous angle, wedge, and beam intensity optimization in inverse radiotherapy planning, Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds, On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery, Parallel application of block-iterative methods in medical imaging and radiation therapy, An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side, The Reflection Method for the Numerical Solution of Linear Systems, Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems, Subgradient method for convex feasibility on Riemannian manifolds, Douglas–Rachford algorithm for control-constrained minimum-energy control problems, On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints, Convex feasibility modeling and projection methods for sparse signal recovery, Finite convergence of a subgradient projections method with expanding controls, A row relaxation method for large \(l_ 1\) problems, Algorithms for the split variational inequality problem, 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, On linear infeasibility arising in intensity-modulated radiation therapy inverse planning, Mathematical optimization in intensity modulated radiation therapy, Non-monotonous sequential subgradient projection algorithm for convex feasibility problem, Mathematical optimization in intensity modulated radiation therapy, A row relaxation method for large minimax problems, Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem, Radiation therapy treatment planning: An \(\mathcal L^ 2\) approach, Optimal error correction and methods of feasible directions, Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures, Computational acceleration of projection algorithms for the linear best approximation problem, Tomography, A generalized projection-based scheme for solving convex constrained optimization problems, Unnamed Item, Distributed resource allocation via multi-agent systems under time-varying networks, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods, Iteration process for fixed point problems and zeros of maximal monotone operators, PARALLEL EXTRAGRADIENT-PROXIMAL METHODS FOR SPLIT EQUILIBRIUM PROBLEMS, Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
