Parallel and Distributed Sparse Optimization

Links

Background

Modern datasets usually have a large number of features or training samples, and they are usually stored in a distributed manner. Motivated by the need of solving sparse optimization problems with large datasets, we propose two approaches including (i) distributed implementations of prox-linear algorithms and (ii) GRock, a parallel greedy coordinate descent method.

Codes and demos

Three parallel C solvers for LASSO

More codes and applications will be uploaded in the coming weeks

Citation

Z. Peng, M. Yan, and W. Yin. Parallel and Distributed Sparse Optimization, preprint, 2013


« Back