The following pages link to (Q5168082):
Displaying 11 items.
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Convex feasibility modeling and projection methods for sparse signal recovery (Q442713) (← links)
- Testing the nullspace property using semidefinite programming (Q633104) (← links)
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
- Algorithms for Sparsity-Constrained Optimization (Q2849653) (← links)
- Theory and applications of compressed sensing (Q2864809) (← links)
- Competitive optimization of compressed sensing (Q3435879) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- On the Compressive Spectral Method (Q5251793) (← links)
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing (Q5356981) (← links)
- Algebraic compressed sensing (Q6042618) (← links)