Pages that link to "Item:Q5073726"
From MaRDI portal
The following pages link to Approximation Bounds for Sparse Programs (Q5073726):
Displaying 9 items.
- Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
- Lagrangian duality and saddle points for sparse linear programming (Q2010427) (← links)
- Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations (Q2022171) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Sparse learning via Boolean relaxations (Q2349117) (← links)
- Parameterized complexity of sparse linear complementarity problems (Q2408196) (← links)
- Design Strategies for ARX with Provable Bounds: Sparx and LAX (Q2958134) (← links)
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance (Q4618248) (← links)
- \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
