## SuiteLasso: a MATLAB suite for regression problems with generalized Lasso regularizers

### Xudong Li, Defeng Sun, Kim-Chuan Toh

The software was first released on January 2019. It was last updated in January 2019. The software is designed to solve linear least squares problems with various generalized lasso regularizers. Currently, it can handle the following regularizers:

- Classic Lasso

$$ \min\Big\{ h(Ax) + \lambda\|x\|_1 \mid x\in \mathbb{R}^n \Big\}$$

Solver: ClassicLasso_SSNAL.m - Fused Lasso

$$\min\Big\{ h(Ax) + \lambda\|x\|_1 + \beta\sum_{k=1}^n|x_{k+1}-x_k| \mid x\in \mathbb{R}^n\Big\}$$

where \(\lambda\) and \(\beta\) are regularization parameters and \(h(x) = \frac{1}{2}\|x\|^2\).

Solver: FusedLasso_SSNAL.m - Elastic net

$$\min\Big\{ h(Ax) + \lambda \|x\|_1 + \frac{\beta}{2}\|x\|^2 \Big\}$$

where \(\lambda\) and \(\beta\) are regularization parameters.

Solver: Under construction. - Group Lasso (non-overlapping): Under construction.

Important note: this is a research software. It is not intended nor designed to be a general purpose software at the moment.

##### Citation:

- Xudong Li, Defeng Sun, and Kim-Chuan Toh, A highly efficient semismooth Netwon augmented Lagrangian method for solving Lasso problems, _SIAM Journal on Optimization, 28 (2018), 433–458.
- Xudong Li, Defeng Sun, and Kim-Chuan Toh, On efficiently solving the subproblems of a level-set method for fused lasso problems, SIAM J. Optimization, 28 (2018), 1842–1866.

**Copyright:**This version of**SuiteLasso**is distributed under the**GNU General Public License 2.0**. For commercial applications that may be incompatible with this license, please contact the authors to discuss alternatives.

##### Download:

You can download the package here: SuiteLasso-0.zip

Please read.Welcome to SuiteLasso-0!

- Firstly, unpack the software.
- Run Matlab in the directory SuiteLasso-0.
- After that, to see whether you have installed SuiteLasso-0 correctly, type:

>> startup >> test_ClassicLasso_random - By now, SuiteLasso is ready for you to use.