Pages that link to "Item:Q2191281"
From MaRDI portal
The following pages link to A smoothing method for sparse optimization over convex sets (Q2191281):
Displaying 5 items.
- Concave programming for minimizing the zero-norm over polyhedral sets (Q989849) (← links)
- An SDP approach for \(\ell_0\)-minimization: application to ARX model segmentation (Q2350847) (← links)
- A penalty decomposition method for the optimization problem with two 0-norm constraints (Q2815703) (← links)
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems (Q5077161) (← links)
- Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints (Q6055122) (← links)