The following pages link to Decoding by Linear Programming (Q3546644):
Displaying 50 items.
- Sparse recovery from extreme eigenvalues deviation inequalities (Q5228345) (← links)
- Modern regularization methods for inverse problems (Q5230515) (← links)
- Hessian Barrier Algorithms for Linearly Constrained Optimization Problems (Q5233100) (← links)
- Exact Camera Location Recovery by Least Unsquared Deviations (Q5236623) (← links)
- Characterization of ℓ1 minimizer in one-bit compressed sensing (Q5236754) (← links)
- A Hybrid Finite-Dimensional RHC for Stabilization of Time-Varying Parabolic Equations (Q5238256) (← links)
- Perturbation Analysis of Orthogonal Least Squares (Q5242545) (← links)
- Quasi-linear Compressed Sensing (Q5250350) (← links)
- Minimization of $\ell_{1-2}$ for Compressed Sensing (Q5251929) (← links)
- Euclidean arrangements in Banach spaces (Q5255556) (← links)
- Compressive Sampling for Energy Spectrum Estimation of Turbulent Flows (Q5258610) (← links)
- A New Computational Method for the Sparsest Solutions to Systems of Linear Equations (Q5258945) (← links)
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels (Q5266378) (← links)
- Nonuniform recovery of fusion frame structured sparse signals (Q5267946) (← links)
- Dynamical sampling in multiply generated shift-invariant spaces (Q5269378) (← links)
- Stable recovery of sparse signals with coherent tight frames via lp-analysis approach (Q5269879) (← links)
- Analog Product Codes Decodable by Linear Programming (Q5272087) (← links)
- Efficient Implementation of Linear Programming Decoding (Q5272373) (← links)
- A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions (Q5275042) (← links)
- The Restricted Isometry Property of Subsampled Fourier Matrices (Q5278293) (← links)
- Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm (Q5300386) (← links)
- A dual split Bregman method for fast $\ell ^1$ minimization (Q5326502) (← links)
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity (Q5348469) (← links)
- Recovery of low-rank matrices based on the rank null space properties (Q5348779) (← links)
- Kernelized Elastic Net Regularization: Generalization Bounds, and Sparse Recovery (Q5380402) (← links)
- Redundancy Techniques for Straggler Mitigation in Distributed Optimization and Learning (Q5381126) (← links)
- CHAOTIC ANALOG-TO-INFORMATION CONVERSION: PRINCIPLE AND RECONSTRUCTABILITY WITH PARAMETER IDENTIFIABILITY (Q5407274) (← links)
- Towards a Mathematical Theory of Super‐resolution (Q5418794) (← links)
- Geometric approach to error-correcting codes and reconstruction of signals (Q5471272) (← links)
- For most large underdetermined systems of equations, the minimal 𝓁<sub>1</sub>‐norm near‐solution approximates the sparsest near‐solution (Q5486262) (← links)
- A time continuation based fast approximate algorithm for compressed sensing related optimization (Q5501146) (← links)
- Sparse Solutions of Linear Diophantine Equations (Q5737776) (← links)
- Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT) (Q5738180) (← links)
- Influences of preconditioning on the mutual coherence and the restricted isometry property of Gaussian/Bernoulli measurement matrices (Q5741242) (← links)
- Confidence Intervals for Low Dimensional Parameters in High Dimensional Linear Models (Q5743269) (← links)
- A Plaintext-Related Image Encryption Algorithm Based on Compressive Sensing and a Novel Hyperchaotic System (Q5854875) (← links)
- Weighted lp − l1 minimization methods for block sparse recovery and rank minimization (Q5856318) (← links)
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares (Q5857850) (← links)
- Robust signal recovery for ℓ <sub>1–2</sub> minimization via prior support information (Q5860797) (← links)
- Supervised-distributed control with joint performance and communication optimisation (Q5863715) (← links)
- Sparse Solutions of a Class of Constrained Optimization Problems (Q5868942) (← links)
- Bayesian hierarchical dictionary learning (Q5875954) (← links)
- A new result on recovery sparse signals using orthogonal matching pursuit (Q5880131) (← links)
- Gaining Outlier Resistance With Progressive Quantiles: Fast Algorithms and Theoretical Studies (Q5881134) (← links)
- Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares (Q5881245) (← links)
- An efficient semismooth Newton method for adaptive sparse signal recovery problems (Q5882234) (← links)
- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization (Q5882242) (← links)
- Stability bounds for reconstruction from sampling erasures (Q5882823) (← links)
- Compressed data separation via unconstrained l1-split analysis (Q5889890) (← links)
- Compressed sensing (Q5900527) (← links)
