Quantitative robust uncertainty principles and optimally sparse decompositions
From MaRDI portal
Publication:2505655
DOI10.1007/S10208-004-0162-XzbMath1102.94020arXivmath/0411273OpenAlexW2160396672WikidataQ56221741 ScholiaQ56221741MaRDI QIDQ2505655
Justin Romberg, Emmanuel J. Candès
Publication date: 28 September 2006
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0411273
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Summability and bases in topological vector spaces (46A35) Sampling theory in information and communication theory (94A20) Stochastic particle methods (65C35) Probabilistic methods for one variable harmonic analysis (42A61)
Related Items (56)
Effect of sensing matrices on quality index parameters for block sparse bayesian learning-based EEG compressive sensing ⋮ Near-ideal model selection by \(\ell _{1}\) minimization ⋮ Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization ⋮ Feasibility-based fixed point networks ⋮ An improved robust ADMM algorithm for quantum state tomography ⋮ A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions ⋮ Wasserstein-Based Projections with Applications to Inverse Problems ⋮ The Nyquist sampling rate for spiraling curves ⋮ Expander \(\ell_0\)-decoding ⋮ An alternating minimization method for matrix completion problems ⋮ A reduced half thresholding algorithm ⋮ Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method ⋮ Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing ⋮ A compressed sensing approach to interpolation of fractional Brownian trajectories for a single particle tracking experiment ⋮ A short note on compressed sensing with partially known signal support ⋮ A unified approach for minimizing composite norms ⋮ Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing ⋮ On the conditioning of random subdictionaries ⋮ Inferring Sparse Preference Lists from Partial Information ⋮ Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information ⋮ A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares ⋮ An overview on the applications of matrix theory in wireless communications and signal processing ⋮ A Barzilai-Borwein type method for minimizing composite functions ⋮ Uncertainty in time-frequency representations on finite Abelian groups and applications ⋮ Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging ⋮ Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem ⋮ Beyond coherence: Recovering structured time-frequency representations ⋮ The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty ⋮ A compressed-sensing approach for closed-loop optimal control of nonlinear systems ⋮ Sparse approximate reconstruction decomposed by two optimization problems ⋮ Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method ⋮ A simple and feasible method for a class of large-scale \(l^1\)-problems ⋮ On uncertainty principles in the finite dimensional setting ⋮ A non-adapted sparse approximation of PDEs with stochastic inputs ⋮ An improved algorithm for basis pursuit problem and its applications ⋮ Sparse approximate solution of partial differential equations ⋮ Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization ⋮ On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them ⋮ Sparse signal representation by adaptive non-uniform B-spline dictionaries on a compact interval ⋮ Linearized Bregman iterations for compressed sensing ⋮ Convergence of the linearized Bregman iteration for ℓ₁-norm minimization ⋮ Iterative hard thresholding for compressed sensing ⋮ Analysis of basis pursuit via capacity sets ⋮ Optimal non-linear models for sparsity and sampling ⋮ On the linear independence of spikes and sines ⋮ An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems ⋮ A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization ⋮ Concave programming for finding sparse solutions to problems with convex constraints ⋮ Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit ⋮ Nonlinear least squares in \(\mathbb R^{N}\) ⋮ Sparse solutions to underdetermined Kronecker product systems ⋮ Compressive Sampling for Energy Spectrum Estimation of Turbulent Flows ⋮ Primal–dual first-order methods for a class of cone programming ⋮ Compressive Sensing-Based Computed Tomography Imaging: An effective approach for COVID-19 Detection ⋮ A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring ⋮ Uncertainty relations for the support of quantum states
Uses Software
This page was built for publication: Quantitative robust uncertainty principles and optimally sparse decompositions
