Pages that link to "Item:Q4618248"
From MaRDI portal
The following pages link to Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance (Q4618248):
Displaying 14 items.
- A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem (Q2036185) (← links)
- Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration (Q2069147) (← links)
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem (Q2203360) (← links)
- Feasibility pump algorithm for sparse representation under Laplacian noise (Q2298553) (← links)
- Optimality conditions for sparse nonlinear programming (Q2361004) (← links)
- Global optimization for sparse solution of least squares problems (Q5058393) (← links)
- A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization (Q5359501) (← links)
- Blind Source Separation Based on Mixed Integer Programming (Q5377310) (← links)
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions (Q5860273) (← links)
- Sparse signal reconstruction via collaborative neurodynamic optimization (Q6076704) (← links)
- Sparse convex optimization toolkit: a mixed-integer framework (Q6087059) (← links)
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures (Q6173959) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
- Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization (Q6585819) (← links)
