Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
type: Item
instance of: scholarly article
title: Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
zbMATH Open document ID: 1207.94027
author: Alexandre Borghi
author: Jérôme Darbon
author: Sylvain Peyronnet
published in: Theoretical Computer Science
publication date: 2011-03-17T00:00:00Z
Mathematics Subject Classification ID: 94A12
zbMATH DE Number: 5867227
zbMATH Keywords: compressed sensing
zbMATH Keywords: pivoting rules
describes a project that uses: FFTW
describes a project that uses: PDCO
describes a project that uses: TwIST
describes a project that uses: DEVEX
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.10.032
OpenAlex ID: W2003709696
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Solving Real-World Linear Programs: A Decade and More of Progress
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: Q3321260
cites work: Q4821526
cites work: Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
cites work: Quantitative robust uncertainty principles and optimally sparse decompositions
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
cites work: Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
cites work: Atomic decomposition by basis pursuit
cites work: Compressed sensing and best 𝑘-term approximation
cites work: Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
cites work: Q3844775
cites work: Q5541756
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: Deterministic constructions of compressed sensing matrices
cites work: Compressed sensing
cites work: Why Simple Shrinkage Is Still Relevant for Redundant Representations?
cites work: An EM algorithm for wavelet-based image restoration
cites work: Steepest-edge simplex algorithms for linear programming
cites work: Cycling in linear programming problems
cites work: A practicable steepest-edge simplex algorithm
cites work: The Split Bregman Method for L1-Regularized Problems
cites work: A semismooth Newton method for Tikhonov functionals with sparsity constraints
cites work: Pivot selection methods of the Devex LP code
cites work: Q5806966
cites work: Q5630824
cites work: Q4488070
cites work: An interior point method in Dantzig-Wolfe decomposition
cites work: Q4864293
cites work: Just relax: convex programming methods for identifying sparse signals in noise
cites work: Greed is Good: Algorithmic Results for Sparse Approximation
cites work: Algorithms for simultaneous sparse approximation. I: Greedy pursuit
cites work: On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
cites work: Interior-point methods with decomposition for solving large-scale linear programs
DOI: 10.1016/J.TCS.2010.10.032
description: scientific article; zbMATH DE number 5867227