# Algorithms for Fitting the Constrained Lasso

arXiv: https://arxiv.org/abs/1611.01511 · HTML: https://mlsanity.com/paper/1611.01511/

## Key facts

- Cited by 18 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Oct 2016.

## Built on by (most cited first, 18 of 18)

- [Optimized ensemble deep learning framework for scalable forecasting of dynamics containing extreme events](https://mlsanity.com/paper/2106.08968/) (2021)
- [Doubly Robust Counterfactual Classification](https://mlsanity.com/paper/2301.06199/) (2023)
- [Generalization In Multi-Objective Machine Learning](https://mlsanity.com/paper/2208.13499/) (2022)
- [Delayed Projection Techniques for Linearly Constrained Problems: Convergence Rates, Acceleration, and Applications](https://mlsanity.com/paper/2101.01505/) (2021)
- [Functional Mixtures-of-Experts](https://mlsanity.com/paper/2202.02249/) (2022)
- [Pareto optimal proxy metrics](https://mlsanity.com/paper/2307.01000/) (2023)
- [Quantum Algorithms for the Pathwise Lasso](https://mlsanity.com/paper/2312.14141/) (2023)
- [An Efficient Difference-of-Convex Solver for Privacy Funnel](https://mlsanity.com/paper/2403.04778/) (2024)
- [A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems](https://mlsanity.com/paper/2111.13878/) (2021)
- [Nonnegative-Constrained Joint Collaborative Representation with Union Dictionary for Hyperspectral Anomaly Detection](https://mlsanity.com/paper/2203.10030/) (2022)
- [Semiparametric Inference for Counterfactual Regression under Intervention-Driven Shift](https://mlsanity.com/paper/2504.02694/) (2025)
- [Modelling Heterogeneity Using Bayesian Structured Sparsity](https://mlsanity.com/paper/2103.15919/) (2021)
- [Weighted Sparse Subspace Representation: A Unified Framework for Subspace Clustering, Constrained Clustering, and Active Learning](https://mlsanity.com/paper/2106.04330/) (2021)
- [Interpretable factorization of clinical questionnaires to identify latent factors of psychopathology](https://mlsanity.com/paper/2312.07762/) (2023)
- [A cost-sensitive constrained Lasso](https://mlsanity.com/paper/2401.18023/) (2024)
- [Affine Subspace Models and Clustering for Patch-Based Image Denoising](https://mlsanity.com/paper/2512.07259/) (2025)
- [HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization](https://mlsanity.com/paper/2604.13179/) (2026)
- [CLASSO: a practical primal path-following algorithm for the constrained LASSO](https://mlsanity.com/paper/2610.17024/) (2026)

## Abstract (arXiv)

We compare alternative computing strategies for solving the constrained lasso problem. As its name suggests, the constrained lasso extends the widely-used lasso to handle linear constraints, which allow the user to incorporate prior information into the model. In addition to quadratic programming, we employ the alternating direction method of multipliers (ADMM) and also derive an efficient solution path algorithm. Through both simulations and real data examples, we compare the different algorithms and provide practical recommendations in terms of efficiency and accuracy for various sizes of data. We also show that, for an arbitrary penalty matrix, the generalized lasso can be transformed to a constrained lasso, while the converse is not true. Thus, our methods can also be used for estimating a generalized lasso, which has wide-ranging applications. Code for implementing the algorithms is freely available in the Matlab toolbox SparseReg.