ART3+

swMATH37004MaRDI QIDQ52706FDOQ52706

Author name not available (Why is that?)

Described by source

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

Cited In (12)

• 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
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
• Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
• Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
• Stochastic block projection algorithms with extrapolation for convex feasibility problems
• A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
• Finite convergence of a subgradient projections method with expanding controls
• Linear Convergence of Projection Algorithms
• Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates

This page was built for software: ART3+