Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (Q2260650): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: PDCO / rank | |||
Normal rank |
Revision as of 11:39, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Necessary and sufficient conditions of solution uniqueness in 1-norm minimization |
scientific article |
Statements
Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (English)
0 references
11 March 2015
0 references
With a given solution to a 1-norm minimization problem, based on the fact that a pair of feasible primal-dual linear programs has strict complementary solutions, the authors provide a necessary and sufficient condition for guaranteeing recovering that solution uniquely. Some ways on numerically recognizing unique solutions and verifying solution uniqueness are discussed.
0 references
\(\ell_1\) minimization
0 references
basis pursuit
0 references
lasso
0 references
solution uniqueness
0 references
strict complementarity
0 references