ART3+
From MaRDI portal
Cited in
(15)- A generalized projection-based scheme for solving convex constrained optimization problems
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
- A non-interior continuation algorithm for solving the convex feasibility problem
- New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
- Linear convergence of projection algorithms
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- SNARK09
- SNARK93
- CoinUtils
- 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
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
This page was built for software: ART3+
