Skip to content

Latest commit

 

History

History
 
 

Sparsa

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
SpaRSA 2.0

January 15, 2009

---------------------------------------------------------------------------
Copyright (2007): Stephen Wright, Robert Nowak, and Mario
Figueiredo.

SpaRSA is distributed under the terms of the GNU General Public
License 2.0.

Permission to use, copy, modify, and distribute this software
for any purpose without fee is hereby granted, provided that
this entire notice is included in all copies of any software
which is or includes a copy or modification of this software
and in all copies of the supporting documentation for such
software. This software is being provided "as is", without any
express or implied warranty. In particular, the authors do not
make any representation or warranty of any kind concerning the
merchantability of this software or its fitness for any
particular purpose."
---------------------------------------------------------------------------


This set of MATLAB files contain an implementation of the
algorithms described in the paper "Sparse Reconstruction by
Separable Approximation", by Stephen Wright, Robert Nowak, and
Mario Figueiredo.

Both the paper and the code are available at
http://www.lx.it.pt/~mtf/SpaRSA/

The algorithm itself is in file SpaRSA.m

For usage details, type "help SpaRSA" at the MATLAB prompt.

There are 5 demos included, which illustrate how to use the
algorithm in some of the examples presented in the paper.

This package also includes the following two algorithms by
other authors (to allow running the comparative tests):

The l1_ls algorithm, which is described and can be downloaded
from http://www.stanford.edu/~boyd/l1_ls/

The FPC algorithm, which can be downloaded from
http://www.caam.rice.edu/~optimization/L1/fpc/fpc.zip

This code is in development stage; any comments or bug reports
are very welcome.

Contacts: [email protected]
          [email protected]
          [email protected]