File Exchange

image thumbnail


version (211 KB) by Stephen Becker
Very fast code for solving lasso and non-negative least-squares problems


Updated 18 Apr 2018

GitHub view license on GitHub

Proximal gradient algorithm for convex optimization, using a diagonal +/- rank-1 norm. Uses special tricks to allow the use of a quasi-Newton methods.

Cite As

Stephen Becker (2020). zeroSR1 (, GitHub. Retrieved .

Comments and Ratings (0)

MATLAB Release Compatibility
Created with R2011a
Compatible with any release
Platform Compatibility
Windows macOS Linux