The following pages link to Decoding by Linear Programming (Q3546644):
Displaying 50 items.
- On the interval of fluctuation of the singular values of random matrices (Q2628338) (← links)
- The Moreau envelope based efficient first-order methods for sparse recovery (Q2628357) (← links)
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization (Q2629808) (← links)
- Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery (Q2632508) (← links)
- An inexact splitting method for the subspace segmentation from incomplete and noisy observations (Q2633544) (← links)
- Exact matrix completion via convex optimization (Q2655288) (← links)
- Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery (Q2656664) (← links)
- A theoretical result of sparse signal recovery via alternating projection method (Q2656767) (← links)
- Sparse non-negative super-resolution -- simplified and stabilised (Q2659719) (← links)
- Smoothing strategy along with conjugate gradient algorithm for signal reconstruction (Q2660684) (← links)
- Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← links)
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization (Q2667049) (← links)
- Sparse signal recovery from phaseless measurements via hard thresholding pursuit (Q2667051) (← links)
- Performance analysis of the compressed distributed least squares algorithm (Q2670748) (← links)
- The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing (Q2672726) (← links)
- Newton-type optimal thresholding algorithms for sparse optimization problems (Q2676159) (← links)
- Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support (Q2681229) (← links)
- Explicit RIP matrices: an update (Q2681274) (← links)
- Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression (Q2687439) (← links)
- Compressed sensing of low-rank plus sparse matrices (Q2689144) (← links)
- A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing (Q2691208) (← links)
- Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements (Q2693686) (← links)
- On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes (Q2693794) (← links)
- The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes (Q2694729) (← links)
- On sparse recovery algorithms in unions of orthonormal bases (Q2696630) (← links)
- Lifted stationary points of sparse optimization with complementarity constraints (Q2696930) (← links)
- Uniqueness in nuclear norm minimization: flatness of the nuclear norm sphere and simultaneous polarization (Q2697005) (← links)
- Posterior information-based image measurement matrix optimization (Q2697739) (← links)
- Restricted isometry property for matrices whose entries are random variables belonging to some Orlicz spaces \(L_U(\Omega)\) (Q2786959) (← links)
- (Q2787249) (← links)
- Duality and Convex Programming (Q2789804) (← links)
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares (Q2796799) (← links)
- Resolution analysis of imaging with \(\ell_1\) optimization (Q2797769) (← links)
- Low Complexity Regularization of Linear Inverse Problems (Q2799919) (← links)
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms (Q2800370) (← links)
- Sparse PCA: Convex Relaxations, Algorithms and Applications (Q2802550) (← links)
- Motion Averaging in 3D Reconstruction Problems (Q2807052) (← links)
- Correcting data corruption errors for multivariate function approximation (Q2818244) (← links)
- Guarantees of Riemannian optimization for low rank matrix recovery (Q2818273) (← links)
- A perturbation analysis of block-sparse compressed sensing via mixed \(\ell_2/\ell_1\) minimization (Q2818328) (← links)
- On low rank approximation of linear operators in \(p\)-norms and some algorithms (Q2821088) (← links)
- Identification of interactions in fractional-order systems with high dimensions (Q2821547) (← links)
- Sparse sensor placement optimization for classification (Q2829445) (← links)
- Fast Implementation of ℓ 1-Greedy Algorithm (Q2840660) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming (Q2841675) (← links)
- Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization (Q2846490) (← links)
- Sparse reconstruction of Hardy signal and applications to time-frequency distribution (Q2846509) (← links)
- Sparse Representation of Signals in Hardy Space (Q2847068) (← links)
- Primal–dual first-order methods for a class of cone programming (Q2867434) (← links)
