Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
From MaRDI portal
Publication:630594
DOI10.1016/j.tcs.2010.10.032zbMath1207.94027OpenAlexW2003709696MaRDI QIDQ630594
Sylvain Peyronnet, Jérôme Darbon, Alexandre Borghi
Publication date: 17 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.032
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- An interior point method in Dantzig-Wolfe decomposition
- Interior-point methods with decomposition for solving large-scale linear programs
- Cycling in linear programming problems
- Steepest-edge simplex algorithms for linear programming
- Deterministic constructions of compressed sensing matrices
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Atomic Decomposition by Basis Pursuit
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Compressed sensing and best 𝑘-term approximation
- The Split Bregman Method for L1-Regularized Problems
- A semismooth Newton method for Tikhonov functionals with sparsity constraints
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- An EM algorithm for wavelet-based image restoration
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
- Solving Real-World Linear Programs: A Decade and More of Progress
- A practicable steepest-edge simplex algorithm
- New Finite Pivoting Rules for the Simplex Method
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Pivot selection methods of the Devex LP code
- Compressed sensing
