Dual formulation of the sparsity constrained optimization problem: application to classification

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Feature selection for support vector machines via mixed integer linear programming
SLOPE-adaptive variable selection via convex optimization
Concave programming for minimizing the zero-norm over polyhedral sets
Linear best approximation using a class of polyhedral norms
Global optimality conditions for nonconvex optimization
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Lagrangian relaxation for SVM feature selection
DC formulations and algorithms for sparse optimization problems
Logistic regression: from art to science
The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Computational study of a family of mixed-integer quadratic programming problems
Feature selection in SVM via polyhedral $k$-norm
Sparse learning via Boolean relaxations
Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions
Feature Selection via Mathematical Programming
10.1162/153244303322753751
Deforming $||.||_{1}$ into $||.||_{\infty}$ via Polyhedral Norms: A Pedestrian Approach
A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization
Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
Compressed sensing
Convergence of a block coordinate descent method for nondifferentiable minimization
Sparse optimization via vector $k$-norm and DC programming with an application to feature selection for support vector machines