Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
From MaRDI portal
Publication:340007
DOI10.1007/s12532-016-0105-yzbMath1353.65057OpenAlexW2346642287MaRDI QIDQ340007
Kevin Lin, Lie Wang, Han Liu, Robert J. Vanderbei
Publication date: 11 November 2016
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/107484
algorithmnumerical examplelinear programminginterior-point methodscompressed sensinglarge-scalesparse signalsparametric simplex method
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Interior-point methods (90C51) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
The regularization continuation method with an adaptive time step control for linearly constrained optimization problems, The regularization continuation method for optimization problems with nonlinear equality constraints, On the spectral structure of Jordan-Kronecker products of symmetric and skew-symmetric matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Splitting dense columns in sparse linear systems
- The restricted isometry property and its implications for compressed sensing
- Combinatorial sublinear-time Fourier algorithms
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps
- Linear programming: foundations and extensions
- Fast Fourier optimization
- Steepest-edge simplex algorithms for linear programming
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- \(\ell_1\)-penalized quantile regression in high-dimensional sparse models
- Randomized first order algorithms with applications to \(\ell _{1}\)-minimization
- A largest-distance pivot rule for the simplex algorithm
- Theory and applications of compressed sensing
- Uncertainty Principles and Signal Recovery
- Compressed sensing and best 𝑘-term approximation
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Stable recovery of sparse overcomplete representations in the presence of noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Sparse and Redundant Representations
- Smoothed analysis of algorithms
- Formulating Two-Stage Stochastic Programs for Interior Point Methods
- ALPO: Another Linear Program Optimizer
- Atomic Decomposition by Basis Pursuit
- LOQO:an interior point code for quadratic programming
- Uncertainty principles and ideal atomic decomposition
- Matching pursuits with time-frequency dictionaries
- Kronecker Compressive Sensing
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Neighborliness of randomly projected simplices in high dimensions
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Compressed sensing
- Linear programming. Foundations and extensions
