%0 Generic %1 goldstein2016field %A Goldstein, Tom %A Studer, Christoph %A Baraniuk, Richard %D 2016 %K fasta, optimization %T A Field Guide to Forward-Backward Splitting with a FASTA Implementation %U http://arxiv.org/abs/1411.3406 %X Non-differentiable and constrained optimization play a key role in machine learning, signal and image processing, communications, and beyond. For high-dimensional minimization problems involving large datasets or many unknowns, the forward-backward splitting method provides a simple, practical solver. Despite its apparently simplicity, the performance of the forward-backward splitting is highly sensitive to implementation details. This article is an introductory review of forward-backward splitting with a special emphasis on practical implementation concerns. Issues like stepsize selection, acceleration, stopping conditions, and initialization are considered. Numerical experiments are used to compare the effectiveness of different approaches. Many variations of forward-backward splitting are implemented in the solver FASTA (short for Fast Adaptive Shrinkage/Thresholding Algorithm). FASTA provides a simple interface for applying forward-backward splitting to a broad range of problems.

@misc{goldstein2016field, abstract = {{Non-differentiable and constrained optimization play a key role in machine learning, signal and image processing, communications, and beyond. For high-dimensional minimization problems involving large datasets or many unknowns, the forward-backward splitting method provides a simple, practical solver. Despite its apparently simplicity, the performance of the forward-backward splitting is highly sensitive to implementation details. This article is an introductory review of forward-backward splitting with a special emphasis on practical implementation concerns. Issues like stepsize selection, acceleration, stopping conditions, and initialization are considered. Numerical experiments are used to compare the effectiveness of different approaches. Many variations of forward-backward splitting are implemented in the solver FASTA (short for Fast Adaptive Shrinkage/Thresholding Algorithm). FASTA provides a simple interface for applying forward-backward splitting to a broad range of problems.}}, added-at = {2018-12-07T09:10:16.000+0100}, archiveprefix = {arXiv}, author = {Goldstein, Tom and Studer, Christoph and Baraniuk, Richard}, biburl = {https://www.bibsonomy.org/bibtex/2a887df0f571671ee0dba4f3c39aa2327/jpvaldes}, citeulike-article-id = {14287862}, citeulike-linkout-0 = {http://arxiv.org/abs/1411.3406}, citeulike-linkout-1 = {http://arxiv.org/pdf/1411.3406}, day = 28, eprint = {1411.3406}, interhash = {4750bbe5ce6e017bfc8b96b40177dda9}, intrahash = {a887df0f571671ee0dba4f3c39aa2327}, keywords = {fasta, optimization}, month = dec, posted-at = {2017-02-26 18:18:56}, priority = {4}, timestamp = {2018-12-07T09:11:29.000+0100}, title = {{A Field Guide to Forward-Backward Splitting with a FASTA Implementation}}, url = {http://arxiv.org/abs/1411.3406}, year = 2016 }