Pages that link to "Item:Q2300635"
From MaRDI portal
The following pages link to Feature selection in SVM via polyhedral \(k\)-norm (Q2300635):
Displaying 18 items.
- DCA based algorithms for feature selection in multi-class support vector machine (Q513636) (← links)
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms (Q889303) (← links)
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm (Q890292) (← links)
- Lagrangian relaxation for SVM feature selection (Q1652409) (← links)
- \(l_{0}\)-norm based structural sparse least square regression for feature selection (Q1669627) (← links)
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
- Proximal operator and optimality conditions for ramp loss SVM (Q2119753) (← links)
- A DC programming approach for feature selection in support vector machines learning (Q2442767) (← links)
- Polytopal balls arising in optimization (Q3391332) (← links)
- (Q4422152) (← links)
- Deforming $||.||_{1}$ into $||.||_{\infty}$ via Polyhedral Norms: A Pedestrian Approach (Q5094918) (← links)
- Convex Optimization for Group Feature Selection in Networked Data (Q5139860) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
- Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)
- A three-operator splitting algorithm with deviations for generalized DC programming (Q6169253) (← links)
- Dual formulation of the sparsity constrained optimization problem: application to classification (Q6585821) (← links)
- Difference of Convex programming in adversarial SVM (Q6593354) (← links)
