Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\ell_1\)-penalized quantile regression in high-dimensional sparse models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp RIP bound for sparse signal and low-rank matrix recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: The restricted isometry property and its implications for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing and best 𝑘-term approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable recovery of sparse overcomplete representations in the presence of noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty principles and ideal atomic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty Principles and Signal Recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborliness of randomly projected simplices in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse nonnegative solution of underdetermined linear equations by linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kronecker Compressive Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse and Redundant Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steepest-edge simplex algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Thresholding Pursuit: An Algorithm for Compressive Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical introduction to compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial sublinear-time Fourier algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized first order algorithms with applications to \(\ell _{1}\)-minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and applications of compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating Two-Stage Stochastic Programs for Interior Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching pursuits with time-frequency dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: CoSaMP: Iterative signal recovery from incomplete and inaccurate samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: A largest-distance pivot rule for the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is Good: Algorithmic Results for Sparse Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting dense columns in sparse linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOQO:an interior point code for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming: foundations and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALPO: Another Linear Program Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming. Foundations and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Fourier optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing / rank
 
Normal rank

Revision as of 22:10, 12 July 2024

scientific article
Language Label Description Also known as
English
Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
scientific article

    Statements

    Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2016
    0 references
    linear programming
    0 references
    compressed sensing
    0 references
    parametric simplex method
    0 references
    sparse signals
    0 references
    interior-point methods
    0 references
    numerical example
    0 references
    large-scale
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references