lasso regression problem (least-squares with l1 regularization for sparsity promotion) (Q6825564)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lasso regression problem (least-squares with l1 regularization for sparsity promotion) |
Composite convex optimization often solved by proximal gradient or coordinate descent.
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | lasso regression problem (least-squares with l1 regularization for sparsity promotion) |
Composite convex optimization often solved by proximal gradient or coordinate descent. |
Statements
0 references
0 references
0 references
0 references
