Pages that link to "Item:Q5094918"
From MaRDI portal
The following pages link to Deforming $||.||_{1}$ into $||.||_{\infty}$ via Polyhedral Norms: A Pedestrian Approach (Q5094918):
Displaying 3 items.
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
- Dual formulation of the sparsity constrained optimization problem: application to classification (Q6585821) (← links)
- Difference of Convex programming in adversarial SVM (Q6593354) (← links)