One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations

DOI10.1007/s10444-016-9467-yzbMath1362.65064arXiv1304.5038OpenAlexW1848983290MaRDI QIDQ2374380

Hui Zhang, Wotao Yin, Ming Yan

Publication date: 15 December 2016

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.5038

zbMATH Keywords

compressive sensingsparse optimizationsparse signal recoveryexact recovery\(\ell_1\)-analysis\(\ell_1\)-synthesisrobust recoveryconvex infinity-norm optimizationdual certificate condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

Signal recovery under cumulative coherence, Quadratic growth conditions and uniqueness of optimal solution to Lasso, Performance analysis for unconstrained analysis based approaches*, Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ₁ minimization, Learning Regularization Parameter-Maps for Variational Image Reconstruction Using Deep Neural Networks and Algorithm Unrolling, The Geometry of Sparse Analysis Regularization, Robust recovery of signals with partially known support information using weighted BPDN, Signal recovery under mutual incoherence property and oracle inequalities, Exact matrix completion based on low rank Hankel structure in the Fourier domain, On uniqueness guarantees of solution in convex regularized linear inverse problems, The homotopy method revisited: Computing solution paths of $\ell _1$-regularized problems, Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction, RIP-based performance guarantee for low-tubal-rank tensor recovery

Cites Work

• Nonlinear total variation based noise removal algorithms
• A mathematical introduction to compressive sensing
• Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
• Remote sensing via \(\ell_1\)-minimization
• On uniqueness guarantees of solution in convex regularized linear inverse problems
• Compressed sensing with coherent and redundant dictionaries
• Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
• The restricted isometry property and its implications for compressed sensing
• The cosparse analysis model and algorithms
• The convex geometry of linear inverse problems
• The Lasso problem and uniqueness
• Local behavior of sparse analysis regularization: applications to risk estimation
• Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
• Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
• Stable Image Reconstruction Using Total Variation Minimization
• Linear convergence rates for Tikhonov regularization with positively homogeneous functionals
• Necessary and sufficient conditions for linear convergence of ℓ1-regularization
• Compressed sensing and best 𝑘-term approximation
• On Sparse Representations in Arbitrary Redundant Bases
• Recovery of Exact Sparse Representations in the Presence of Bounded Noise
• Greed is Good: Algorithmic Results for Sparse Approximation
• Stable Signal Reconstruction via $\ell^1$-Minimization in Redundant, Non-Tight Frames
• Stable and Robust Sampling Strategies for Compressive Imaging
• Robust analysis ℓ₁-recovery from Gaussian measurements and total variation minimization
• Model selection with low complexity priors
• Convergence rates of convex variational regularization
• Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
• A Probabilistic and RIPless Theory of Compressed Sensing
• Analysis versus synthesis in signal priors
• Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
• Sparse nonnegative solution of underdetermined linear equations by linear programming