Pages that link to "Item:Q2472373"
From MaRDI portal
The following pages link to A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy (Q2472373):
Displaying 13 items.
- ART3+ (Q52706) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- Finite convergence of a subgradient projections method with expanding controls (Q649124) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
- A non-interior continuation algorithm for solving the convex feasibility problem (Q1634140) (← links)
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems (Q2149580) (← links)
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections (Q3563617) (← links)
- Stochastic block projection algorithms with extrapolation for convex feasibility problems (Q5058397) (← links)
- New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization (Q5162590) (← links)
- Linear Convergence of Projection Algorithms (Q5219736) (← links)
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)