Pages that link to "Item:Q3799576"
From MaRDI portal
The following pages link to On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning (Q3799576):
Displayed 35 items.
- An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side (Q356073) (← links)
- Subgradient method for convex feasibility on Riemannian manifolds (Q415385) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- Convex feasibility modeling and projection methods for sparse signal recovery (Q442713) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- Non-monotonous sequential subgradient projection algorithm for convex feasibility problem (Q519264) (← links)
- Finite convergence of a subgradient projections method with expanding controls (Q649124) (← links)
- Algorithms for the split variational inequality problem (Q663488) (← links)
- A row relaxation method for large minimax problems (Q688632) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
- Fast simultaneous angle, wedge, and beam intensity optimization in inverse radiotherapy planning (Q833395) (← links)
- Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951) (← links)
- A row relaxation method for large \(l_ 1\) problems (Q1176532) (← links)
- Radiation therapy treatment planning: An \(\mathcal L^ 2\) approach (Q1207809) (← links)
- Optimal error correction and methods of feasible directions (Q1762400) (← links)
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907) (← links)
- Distributed resource allocation via multi-agent systems under time-varying networks (Q2063830) (← links)
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures (Q2260660) (← links)
- Iteration process for fixed point problems and zeros of maximal monotone operators (Q2338025) (← links)
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems (Q2423796) (← links)
- On linear infeasibility arising in intensity-modulated radiation therapy inverse planning (Q2472384) (← links)
- Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
- Tomography (Q2789814) (← links)
- Iterative prescription refinement in fully discretized inverse problems of radiation therapy planning (Q2891248) (← links)
- Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods (Q3114578) (← links)
- Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds (Q3454509) (← links)
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections (Q3563617) (← links)
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery (Q4559404) (← links)
- PARALLEL EXTRAGRADIENT-PROXIMAL METHODS FOR SPLIT EQUILIBRIUM PROBLEMS (Q5011633) (← links)
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections (Q5013582) (← links)
- (Q5126296) (← links)
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem (Q5169443) (← links)
- Mathematical optimization in intensity modulated radiation therapy (Q5900895) (← links)
- Mathematical optimization in intensity modulated radiation therapy (Q5902146) (← links)
- The Reflection Method for the Numerical Solution of Linear Systems (Q6071828) (← links)