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)- Robust estimation for an inverse problem arising in multiview geometry
- On the implementation of ADMM with dynamically configurable parameter for the separable _1/_2 minimization
- Selection of Two-Level Supersaturated Designs for Main Effects Models
- How robust is randomized blind deconvolution via nuclear norm minimization against adversarial noise?
- On the size of incoherent systems
- Sparse approximate solution of partial differential equations
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- Local recovery bounds for prior support constrained compressed sensing
- Adaptive Algorithm for Multi-Armed Bandit Problem with High-Dimensional Covariates
- The gap between the null space property and the restricted isometry property
- Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems
- Multi-stage convex relaxation for feature selection
- Largest magnitude for off-diagonal auto-correlation coefficients in high dimensional framework
- Estimator of prediction error based on approximate message passing for penalized linear regression
- Guarantees of Riemannian optimization for low rank matrix recovery
- Compressed sensing MR image reconstruction exploiting TGV and wavelet sparsity
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
- On sparse representation of analytic signal in Hardy space
- A semidefinite programming study of the Elfving theorem
- An Interactive Greedy Approach to Group Sparsity in High Dimensions
- \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery
- Jointly evolving and compressing fuzzy system for feature reduction and classification
- Distributed secure state estimation for cyber-physical systems under sensor attacks
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- Compressed dictionary learning
- Chaotic analog-to-information conversion: principle and reconstructability with parameter identifiability
- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
- A note on the complexity of \(L _{p }\) minimization
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- Optimizing sparsity over lattices and semigroups
- Error estimates for orthogonal matching pursuit and random dictionaries
- Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications
- A dual split Bregman method for fast \(\ell ^{1}\) minimization
- An overview on the applications of matrix theory in wireless communications and signal processing
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- A remark on joint sparse recovery with OMP algorithm under restricted isometry property
- A general theory of singular values with applications to signal denoising
- Perturbation Analysis of Orthogonal Least Squares
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
- The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
- Sparsest representations and approximations of an underdetermined linear system
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
- Sparse approximate reconstruction decomposed by two optimization problems
- New analysis of manifold embeddings and signal recovery from compressive measurements
- Weighted \(\ell_p\) (\(0<p\le 1\)) minimization with non-uniform weights for sparse recovery under partial support information
- Sparse PSD approximation of the PSD cone
- Sparse representation of vectors in lattices and semigroups
- Reconstruction of sparse signals in impulsive disturbance environments
- On the interval of fluctuation of the singular values of random matrices
- New preconditioners applied to linear programming and the compressive sensing problems
- Phaseless compressive sensing using partial support information
- Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparse recovery by non-convex optimization - instance optimality
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Support vector machines regression with l^1-regularizer
- Randomized orthogonal matching pursuit algorithm with adaptive partial selection for sparse signal recovery
- A smoothed \(l_0\)-norm and \(l_1\)-norm regularization algorithm for computed tomography
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
- Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case
- Nonlinear Iterative Hard Thresholding for Inverse Scattering
- Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals
- Nonconvex _p-_q minimization method and p-RIP condition for stable recovery of approximately k-sparse signals
- Random projections for linear programming
- Regularity properties for sparse regression
- Recovering low-rank and sparse matrix based on the truncated nuclear norm
- Approximation of frame based missing data recovery
- On the grouping effect of the \(l_{1-2}\) models
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Gaining Outlier Resistance With Progressive Quantiles: Fast Algorithms and Theoretical Studies
- On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The trimmed Lasso: sparse recovery guarantees and practical optimization by the generalized soft-min penalty
- Approximation of rectangular beta-Laguerre ensembles and large deviations
- Guarantees of total variation minimization for signal recovery
- Super-resolution of point sources via convex programming
- On the optimization landscape of tensor decompositions
- Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints
- Signal recovery under cumulative coherence
- Phase transitions for greedy sparse approximation algorithms
- Correcting data corruption errors for multivariate function approximation
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Robust width: a characterization of uniformly stable and robust compressed sensing
- A remark on compressed sensing
- Quantile-based iterative methods for corrupted systems of linear equations
- A fast active set block coordinate descent algorithm for _1-regularized least squares
- A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation
- Sparse signal recovery with prior information by iterative reweighted least squares algorithm
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Kernelized elastic net regularization: generalization bounds, and sparse recovery
- Constructing surrogate models of complex systems with enhanced sparsity: quantifying the influence of conformational uncertainty in biomolecular solvation
- Mathematical algorithm design for deep learning under societal and judicial constraints: the algorithmic transparency requirement
- Random projections of smooth manifolds
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
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)
