Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
Martin J. Wainwright and Pradeep Ravikumar and Alekh Agarwal

Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes.pdf300.92kB
Type: Paper
Tags:

Bibtex:
@article{11:34,author={Pradeep Ravikumar and Alekh Agarwal and Martin J. Wainwright}, Title={Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes},journal={Journal of Machine Learning Research},volume={11}, url={http://www.jmlr.org/papers/volume11/ravikumar10a/ravikumar10a.pdf}}

10 day statistics (1 downloads)

Average Time 1 mins, 46 secs
Average Speed 2.84kB/s
Best Time 1 mins, 46 secs
Best Speed 2.84kB/s
Worst Time 1 mins, 46 secs
Worst Speed 2.84kB/s
Report