Decoding by Linear Programming
From MaRDI portal
Publication:3546644
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)- Compressed sensing
- Multilevel preconditioning and adaptive sparse solution of inverse problems
- Penalized wavelet nonparametric univariate logistic regression for irregular spaced data
- Sparse approximation using \(\ell_1-\ell_2\) minimization and its application to stochastic collocation
- Stochastic collocation methods via \(\ell_1\) minimization using randomized quadratures
- A new computational method for the sparsest solutions to systems of linear equations
- Heat source identification based on \(\ell_1\) constrained minimization
- Restricted isometry property for random matrices with heavy-tailed columns
- Exact camera location recovery by least unsquared deviations
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- Typical reconstruction performance for distributed compressed sensing based on \(\ell_{2,1} \)-norm regularized least square and Bayesian optimal reconstruction: influences of noise
- Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
- Bayesian hierarchical dictionary learning
- What is a Frame? Theory and Applications of Frames
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- A general theory of concave regularization for high-dimensional sparse estimation problems
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Newton method for \(\ell_0\)-regularized optimization
- Orthogonal one step greedy procedure for heteroscedastic linear models
- Analysis of a nonsmooth optimization approach to robust estimation
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Every Hilbert space frame has a Naimark complement
- Cirrhosis classification based on texture classification of random features
- Hierachical Bayesian models and sparsity: \(\ell_2\)-magic
- $\ell _0$ Minimization for wavelet frame based image restoration
- 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 benefit of group sparsity
- Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization
- Identifying small mean-reverting portfolios
- A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
- A simple proof of the restricted isometry property for random matrices
- On some aspects of approximation of ridge functions
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery
- Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
- Sylvester-Gallai type theorems for approximate collinearity
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- A compressive sensing based privacy preserving outsourcing of image storage and identity authentication service in cloud
- Tensor sparse representation via Einstein product
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Matrix recovery from nonconvex regularized least absolute deviations
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Some sharp performance bounds for least squares regression with L₁ regularization
- A variable projection method for large-scale inverse problems with \(\ell^1\) regularization
- Reconstruction of sparse connectivity in neural networks from spike train covariances
- Dictionary-based classification models. Applications for multichannel neural activity analysis
- Nonlinear frames and sparse reconstructions in Banach spaces
- Nearly optimal minimax estimator for high-dimensional sparse linear regression
- A simpler approach to coefficient regularized support vector machines regression
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
- On solutions of sparsity constrained optimization
- Proximal variable metric method with spectral diagonal update for large scale sparse optimization
- Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
- Observability for initial value problems with sparse initial data
- On the conditions used to prove oracle results for the Lasso
- A statistical mechanics approach to de-biasing and uncertainty estimation in Lasso for random measurements
- The modified accelerated Bregman method for regularized basis pursuit problem
- Search for sparse solutions of super-large systems with a tensor structure
- A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networks
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
- Hierarchical compressed sensing
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach
- System identification in the presence of outliers and random noises: a compressed sensing approach
- Minimizers of sparsity regularized Huber loss function
- The road to deterministic matrices with the restricted isometry property
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis
- An unbiased approach to compressed sensing
- An adaptation for iterative structured matrix completion
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
- Sparse approximation of fitting surface by elastic net
- Gradient projection Newton pursuit for sparsity constrained optimization
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Binary generalized orthogonal matching pursuit
- Sparse PCA: convex relaxations, algorithms and applications
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing
- A plaintext-related image encryption algorithm based on compressive sensing and a novel hyperchaotic system
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- Recovery of sparsest signals via \(\ell^q \)-minimization
- A fast and effective algorithm for sparse linear regression with \(\ell_p\)-norm data fidelity and elastic net regularization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Sorted concave penalized regression
- Fast sparse reconstruction: Greedy inverse scale space flows
- Confidence intervals for low dimensional parameters in high dimensional linear models
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Nonconvex compressed sampling of natural images and applications to compressed MR imaging
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Fast implementation of \(\ell ^1\)-greedy algorithm
- Robust estimation for an inverse problem arising in multiview geometry
- Selection of Two-Level Supersaturated Designs for Main Effects Models
- 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
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)
