Pages that link to "Item:Q2311128"
From MaRDI portal
The following pages link to The sparsest solution of the union of finite polytopes via its nonconvex relaxation (Q2311128):
Displaying 4 items.
- An efficient algorithm for non-convex sparse optimization (Q2315622) (← links)
- Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
- On Theorem 10 in &#x201C;On Polar Polytopes and the Recovery of Sparse Representations&#x201D; [Sep 07 3188-3195] (Q5346445) (← links)
- Sparse Solutions of a Class of Constrained Optimization Problems (Q5868942) (← links)