Decoding by Linear Programming
From MaRDI portal
Recommendations
- Stable signal recovery from incomplete and inaccurate measurements
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- Highly Robust Error Correction byConvex Programming
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
Cited in
(only showing first 100 items - show all)- Lasso-type recovery of sparse representations for high-dimensional data
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Random projections of smooth manifolds
- Sparse solutions to underdetermined Kronecker product systems
- A simple proof of the restricted isometry property for random matrices
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
- Selection by partitioning the solution paths
- A unified approach to model selection and sparse recovery using regularized least squares
- Nearly unbiased variable selection under minimax concave penalty
- Signal recovery under cumulative coherence
- Secure estimation based Kalman filter for cyber-physical systems against sensor attacks
- On the post selection inference constant under restricted isometry properties
- Gaussian polytopes: a cumulant-based approach
- Observable dictionary learning for high-dimensional statistical inference
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- Sparse approximate solution of fitting surface to scattered points by MLASSO model
- Compressed sensing for real measurements of quaternion signals
- Sparsity and independence: balancing two objectives in optimization for source separation with application to fMRI analysis
- Compressed sensing of data with a known distribution
- Expander \(\ell_0\)-decoding
- \(l_{0}\)-norm based structural sparse least square regression for feature selection
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
- Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
- Online fault diagnosis for nonlinear power systems
- Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
- A hierarchical framework for recovery in compressive sensing
- Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization
- Deterministic construction of compressed sensing matrices based on semilattices
- Hybrid reconstruction of quantum density matrix: when low-rank meets sparsity
- A Rice method proof of the null-space property over the Grassmannian
- A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
- Random matrices and erasure robust frames
- A group adaptive elastic-net approach for variable selection in high-dimensional linear regression
- Learning data discretization via convex optimization
- Sparsity and incoherence in orthogonal matching pursuit
- Linear regression with sparsely permuted data
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression
- Recovery of signals under the condition on RIC and ROC via prior support information
- Sparse Markowitz portfolio selection by using stochastic linear complementarity approach
- Linear convergence of the randomized sparse Kaczmarz method
- Image encryption technique combining compressive sensing with double random-phase encoding
- A simpler approach to coefficient regularized support vector machines regression
- Signal recovery under mutual incoherence property and oracle inequalities
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- An overview on the applications of matrix theory in wireless communications and signal processing
- A remark on joint sparse recovery with OMP algorithm under restricted isometry property
- Sparse signal recovery with prior information by iterative reweighted least squares algorithm
- A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- A probabilistic learning algorithm for robust modeling using neural networks with random weights
- DC formulations and algorithms for sparse optimization problems
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- The noncooperative transportation problem and linear generalized Nash games
- Support vector machines regression with l^1-regularizer
- On the sparseness of 1-norm support vector machines
- On finding a generalized lowest rank solution to a linear semi-definite feasibility problem
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Compressive sensing in signal processing: algorithms and transform domain formulations
- Efficient extreme learning machine via very sparse random projection
- An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
- The convex geometry of linear inverse problems
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Strengthening hash families and compressive sensing
- Robust estimation for an inverse problem arising in multiview geometry
- Full spark frames
- Sparse total least squares: analysis and greedy algorithms
- Compressed sensing and matrix completion with constant proportion of corruptions
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
- Minimax risks for sparse regressions: ultra-high dimensional phenomenons
- Estimation of Gaussian graphs by model selection
- On the conditions used to prove oracle results for the Lasso
- The adaptive and the thresholded Lasso for potentially misspecified models (and a lower bound for the Lasso)
- Restricted \(p\)-isometry properties of partially sparse signal recovery
- A short note on compressed sensing with partially known signal support
- Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling
- Kernel conjugate gradient methods with random projections
- A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
- On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems
- The landscape of empirical risk for nonconvex losses
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
- Sparse approximation of fitting surface by elastic net
- Optimality conditions for locally Lipschitz optimization with l₀-regularization
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
- Sparse approximate reconstruction decomposed by two optimization problems
- An algebraic perspective on integer sparse recovery
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
- A sharp RIP condition for orthogonal matching pursuit
- An augmented Lagrangian algorithm for total bounded variation regularization based image deblurring
This page was built for publication: Decoding by Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546644)
