Sharp recovery bounds for convex demixing, with applications
From MaRDI portal
Publication:404302
DOI10.1007/S10208-014-9191-2zbMath1312.94016arXiv1205.1580OpenAlexW2051237969MaRDI QIDQ404302
Michael B. McCoy, Joel A. Tropp
Publication date: 4 September 2014
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.1580
Geometric probability and stochastic geometry (60D05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (11)
Conic support measures ⋮ A proximal-based algorithm for piecewise sparse approximation with application to scattered data fitting ⋮ A Rice method proof of the null-space property over the Grassmannian ⋮ Super-resolution of point sources via convex programming ⋮ Concentration of the Intrinsic Volumes of a Convex Body ⋮ Stable low-rank matrix recovery via null space properties ⋮ Discrete uncertainty principles and sparse signal processing ⋮ Intersection probabilities and kinematic formulas for polyhedral cones ⋮ Sparse recovery from extreme eigenvalues deviation inequalities ⋮ Robust non-parametric regression via incoherent subspace projections ⋮ Signal Decomposition Using Masked Proximal Operators
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to generate random matrices from the classical compact groups
- Compressed sensing with coherent and redundant dictionaries
- Robust smoothed analysis of a condition number for linear programming
- On the linear independence of spikes and sines
- Elliptically contoured distributions
- Random projections of regular simplices
- Nonlinear methods of approximation
- Some remarks on greedy algorithms
- The convex geometry of linear inverse problems
- Two proposals for robust PCA using semidefinite programming
- Random projections of regular polytopes
- Probability of unique integer solution to a system of linear equations
- Universality in polytope phase transitions and message passing algorithms
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Intrinsic volumes of symmetric cones and applications in convex programming
- Graßmann angles of convex polytopes
- On the geometrical moments of skew-regular simplices in hyperspherical space, with some applications in geometry and mathematical statistics
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- Near Minimax Line Spectral Estimation
- Probabilistic Recovery Guarantees for Sparsely Corrupted Signals
- Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
- Signal Recovery on Incoherent Manifolds
- Robust principal component analysis?
- Uncertainty Principles and Signal Recovery
- Graph Implementations for Nonsmooth Convex Programs
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Rank-Sparsity Incoherence for Matrix Decomposition
- Stochastic and Integral Geometry
- Image decomposition via the combination of sparse representations and a variational approach
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Morphological Diversity and Sparsity in Blind Source Separation
- Linear Inversion of Band-Limited Reflection Seismograms
- An asymptotic estimate of the average number of steps of the parametric simplex method
- An analog scrambling scheme which does not expand bandwidth, Part II: Continuous time
- Non-linear angle-sum relations for polyhedral cones and polytopes
- An analog scrambling scheme which does not expand bandwidth, Part I: Discrete time
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models
- Integrable KP Coupling and Its Exact Solution
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Compressive principal component pursuit
- Living on the edge: phase transitions in convex programs with random data
- Robust PCA via Outlier Pursuit
- Recovery of Sparsely Corrupted Signals
- Precise Stability Phase Transitions for $\ell_1$ Minimization: A Unified Geometric Framework
- Dense Error Correction Via $\ell^1$-Minimization
- Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling
- Analysis versus synthesis in signal priors
- Corrupted Sensing: Novel Guarantees for Separating Structured Signals
- Sparse solutions to linear inverse problems with multiple measurement vectors
- Neighborliness of randomly projected simplices in high dimensions
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
- Separation Properties of Convex Cones
- Compressed sensing
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
This page was built for publication: Sharp recovery bounds for convex demixing, with applications
