Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (Q2260650): Difference between revisions

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

zbMATH Keywords

$\ell_1$ minimization

0 references

basis pursuit

0 references

lasso

0 references

solution uniqueness

0 references

strict complementarity

0 references

describes a project that uses

PDCO

0 references

L1TestPack

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Least angle regression. (With discussion)

0 references

Sensitivity Analysis for Mean-Variance Portfolio Problems

0 references

Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization

0 references

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

0 references

Uncertainty principles and ideal atomic decomposition

0 references

A generalized uncertainty principle and sparse representation in pairs of bases

0 references

Compressed sensing

0 references

Compressed sensing and best 𝑘-term approximation

0 references

Decoding by Linear Programming

0 references

Theory of compressive sensing via $\ell_1$-minimization: a non-RIP analysis and extensions

0 references

A Probabilistic and RIPless Theory of Compressed Sensing

0 references

Q3323698

0 references

Atomic Decomposition by Basis Pursuit

0 references

Q4864293

0 references

On Sparse Representations in Arbitrary Redundant Bases

0 references

Simple bounds for recovering low-complexity models

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Recovery of Short, Complex Linear Combinations Via&lt;tex&gt;$ell _1$&lt;/tex&gt;Minimization

0 references

Necessary and sufficient conditions for linear convergence of ℓ1-regularization

0 references

A necessary and sufficient condition for exact sparse recovery by $\ell_1$ minimization

0 references

Recovery of Exact Sparse Representations in the Presence of Bounded Noise

0 references

The Lasso problem and uniqueness

0 references

Q4225802

0 references

Convergence behavior of interior-point algorithms

0 references

Constructing Test Instances for Basis Pursuit Denoising

0 references

Identifiers

zbMATH Open document ID

1308.65102

0 references

DOI

10.1007/s10957-014-0581-z

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2260650

@@ Property / arXiv ID @@
+.0652
@@ Property / arXiv ID: 1209.0652 / rank @@
+Normal rank
@@ Property / cites work @@
+Least angle regression. (With discussion)
@@ Property / cites work: Least angle regression. (With discussion) / rank @@
+Normal rank
@@ Property / cites work @@
+Sensitivity Analysis for Mean-Variance Portfolio Problems
+Normal rank
@@ Property / cites work @@
+Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ             <sup>1</sup>             minimization
+Normal rank
@@ Property / cites work @@
+From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
+Normal rank
@@ Property / cites work @@
+Uncertainty principles and ideal atomic decomposition
+Normal rank
@@ Property / cites work @@
+A generalized uncertainty principle and sparse representation in pairs of bases
+Normal rank
@@ Property / cites work @@
+Compressed sensing
@@ Property / cites work: Compressed sensing / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed sensing and best 𝑘-term approximation
+Normal rank
@@ Property / cites work @@
+Decoding by Linear Programming
@@ Property / cites work: Decoding by Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
+Normal rank
@@ Property / cites work @@
+A Probabilistic and RIPless Theory of Compressed Sensing
+Normal rank
@@ Property / cites work @@
+Q3323698
@@ Property / cites work: Q3323698 / rank @@
+Normal rank
@@ Property / cites work @@
+Atomic Decomposition by Basis Pursuit
@@ Property / cites work: Atomic Decomposition by Basis Pursuit / rank @@
+Normal rank
@@ Property / cites work @@
+Q4864293
@@ Property / cites work: Q4864293 / rank @@
+Normal rank
@@ Property / cites work @@
+On Sparse Representations in Arbitrary Redundant Bases
+Normal rank
@@ Property / cites work @@
+Simple bounds for recovering low-complexity models
+Normal rank
@@ Property / cites work @@
+Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
+Normal rank
@@ Property / cites work @@
+Recovery of Short, Complex Linear Combinations Via&amp;lt;tex&amp;gt;$ell _1$&amp;lt;/tex&amp;gt;Minimization
+Normal rank
@@ Property / cites work @@
+Necessary and sufficient conditions for linear convergence of ℓ1-regularization
+Normal rank
@@ Property / cites work @@
+A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
+Normal rank
@@ Property / cites work @@
+Recovery of Exact Sparse Representations in the Presence of Bounded Noise
+Normal rank
@@ Property / cites work @@
+The Lasso problem and uniqueness
@@ Property / cites work: The Lasso problem and uniqueness / rank @@
+Normal rank
@@ Property / cites work @@
+Q4225802
@@ Property / cites work: Q4225802 / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence behavior of interior-point algorithms
@@ Property / cites work: Convergence behavior of interior-point algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing Test Instances for Basis Pursuit Denoising
+Normal rank