Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (Q2260650)
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: Necessary and sufficient conditions of solution uniqueness in 1-norm minimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0 references
0.8511618971824646
0 references
0.8001849055290222
0 references
0.7840636372566223
0 references
0.7795225977897644
0 references
0.7743384838104248
0 references
