Paper:
http://blog.csdn.net/lansatiankongxxc/article/details/23826557
Code:
http://www.eecs.berkeley.edu/~yang/software/l1benchmark/
Fast l-1 Minimization Algorithms: Homotopy and Augmented Lagrangian Method -- Implementation from Fixed-Point MPUs to Many-Core CPUs/GPUs Allen Y. Yang, Arvind Ganesh, Zihan Zhou, Andrew Wagner, Victor Shia, Shankar Sastry, and Yi Ma |
© Copyright Notice: It is important that you read and understand the copyright of the following software packages as specified in the individual items. The copyright varies with each package due to its author(s). The packages should NOT be used for any commercial purposes without direct consent of their author(s).
This project is partially supported by NSF TRUST Center at UC Berkeley, ARO MURI W911NF-06-1-0076, ARL MAST-CTA W911NF-08-2-0004.
Publications
| |
MATLAB Benchmark Scripts
The package contains a consolidated implementation of nine l-1 minimization algorithms in MATLAB. Each function uses a consistent set of parameters (e.g., stopping criterion and tolerance) to interface with our benchmark scripts.
The package also contains a script to generate the synthetic data shown in the paper [1]. | |
Single-Core l-1 Minimization Library in C
| |
Fixed-Point l-1 Minimization for Mobile Platforms
| |
Many-Core l-1 Minimization Library in C/CUDA
| |
Other Public l-1 Minimization Libraries
|
求解sparse code 优化工具箱
http://users.ece.gatech.edu/~justin/l1magic/