|
|||||
Overview FASTA (Fast Adaptive Shrinkage/Thresholding Algorithm) is an efficient, easy-to-use implementation of the Forward-Backward Splitting (FBS) method for minimizing compound objective functions. Many variations on FBS are available in FASTA, including the popular accelerated variant FISTA (Beck and Teboulle ’09), the adaptive stepsize rule SpaRSA (Wright, Nowak, Figueiredo ’09), and other variants described in the review A Field Guide to Forward-Backward Splitting with a FASTA Implementation. Downloads The following files are available for download:
What can FASTA solve? FASTA targets problems of the form About the Authors Fasta was developed by: Tom Goldstein - University of Maryland Christoph Studer - Cornell University Richard Baraniuk - Rice University How to cite FASTA If you find that FASTA has contributed to your published work, please include the following citations: @article{GoldsteinStuderBaraniuk:2014, Author = {Goldstein, Tom and Studer, Christoph and Baraniuk, Richard}, Title = {A Field Guide to Forward-Backward Splitting with a {FASTA} Implementation}, year = {2014}, journal = {arXiv eprint}, volume = {abs/1411.3406}, url = {http://arxiv.org/abs/1411.3406}, ee = {http://arxiv.org/abs/1411.3406} } @misc{FASTA:2014, Author = {Goldstein, Tom and Studer, Christoph and Baraniuk, Richard}, title = {{FASTA}: A Generalized Implementation of Forward-Backward Splitting}, note = {http://arxiv.org/abs/1501.04979}, month = {January}, year = {2015} } |