Groups
Category
L1 regularization (Lasso) adds a penalty \(\lambda \sum_{i=1}^{p} |w_i|\) to the loss, which pushes many coefficients exactly to zero and performs feature selection.
A convex optimization problem minimizes a convex function over a convex set, guaranteeing that every local minimum is a global minimum.