The following pages link to Decoding by Linear Programming (Q3546644):
Displaying 50 items.
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids (Q2338485) (← links)
- On some aspects of approximation of ridge functions (Q2344299) (← links)
- Near oracle performance and block analysis of signal space greedy methods (Q2344305) (← links)
- Error analysis of reweighted \(l_1\) greedy algorithm for noisy reconstruction (Q2345681) (← links)
- Greedy signal space methods for incoherence and beyond (Q2347895) (← links)
- New analysis of manifold embeddings and signal recovery from compressive measurements (Q2347898) (← links)
- Stable recovery of analysis based approaches (Q2347901) (← links)
- Sparse learning via Boolean relaxations (Q2349117) (← links)
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization (Q2352420) (← links)
- Optimal \(D\)-RIP bounds in compressed sensing (Q2353238) (← links)
- The sparsest solution to the system of absolute value equations (Q2356345) (← links)
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions (Q2359139) (← links)
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery (Q2360780) (← links)
- Optimality conditions for sparse nonlinear programming (Q2361004) (← links)
- Greedy strategies for convex optimization (Q2363679) (← links)
- Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)
- Split Bregman iteration algorithm for image deblurring using fourth-order total bounded variation regularization model (Q2375444) (← links)
- Compressed sensing by inverse scale space and curvelet thresholding (Q2378722) (← links)
- Reconstruction of sparse signals in impulsive disturbance environments (Q2399059) (← links)
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach (Q2399645) (← links)
- Explicit universal sampling sets in finite vector spaces (Q2399652) (← links)
- A new bound on the block restricted isometry constant in compressed sensing (Q2400748) (← links)
- Adaptive step-size matching pursuit algorithm for practical sparse reconstruction (Q2402080) (← links)
- Improved RIP conditions for compressed sensing with coherent tight frames (Q2403862) (← links)
- The modified accelerated Bregman method for regularized basis pursuit problem (Q2405606) (← links)
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing (Q2405990) (← links)
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields (Q2410045) (← links)
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← links)
- The linearized alternating direction method of multipliers for sparse group LAD model (Q2421443) (← links)
- A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
- Model identification of a network as compressing sensing (Q2434442) (← links)
- Noncommutative Bennett and Rosenthal inequalities (Q2434917) (← links)
- Randomized first order algorithms with applications to \(\ell _{1}\)-minimization (Q2434980) (← links)
- Multi-stage convex relaxation for feature selection (Q2435243) (← links)
- Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices (Q2437333) (← links)
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures (Q2437335) (← links)
- Heat source identification based on \(\ell_1\) constrained minimization (Q2437931) (← links)
- Partial \(S\)-goodness for partially sparse signal recovery (Q2438325) (← links)
- Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications (Q2449220) (← links)
- Restricted isometry property for random matrices with heavy-tailed columns (Q2450279) (← links)
- Optimized projections for compressed sensing via rank-constrained nearest correlation matrix (Q2450944) (← links)
- Deterministic constructions of compressed sensing matrices (Q2465825) (← links)
- Gaussian averages of interpolated bodies and applications to approximate reconstruction (Q2472364) (← links)
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder). (Q2473068) (← links)
- \(L^{1}\)-minimization methods for Hamilton-Jacobi equations: the one-dimensional case (Q2483025) (← links)
- Quantitative robust uncertainty principles and optimally sparse decompositions (Q2505655) (← links)
- Learning in compressed space (Q2510741) (← links)
- Robust multi-image processing with optimal sparse regularization (Q2515365) (← links)
