Coordinate descent with arbitrary sampling II: expected separable overapproximationOpen Website

2016 (modified: 03 Nov 2022)Optim. Methods Softw. 2016Readers: Everyone
Abstract: The design and complexity analysis of randomized coordinate descent methods, and in particular of variants which update a random subset (sampling) of coordinates in each iteration, depend on the no...
0 Replies

Loading