DSCOVR
From MaRDI portal
Cited in
(9)- On lower iteration complexity bounds for the convex concave saddle point problems
- Worst-case complexity of cyclic coordinate descent: O(n^2) gap with randomized version
- SGDLibrary
- AIDE
- DiSCO
- A class of parallel doubly stochastic algorithms for large-scale learning
- Dual iterative hard thresholding
- On convergence of distributed approximate Newton methods: globalization, sharper bounds and beyond
- An Optimal Algorithm for Decentralized Finite-Sum Optimization
This page was built for software: DSCOVR