Sparse optimization via vector $k$-norm and DC programming with an application to feature selection for support vector machines

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Nearly unbiased variable selection under minimax concave penalty
Best subset selection via a modern optimization lens
Feature subset selection for logistic regression via mixed integer optimization
A rank-corrected procedure for matrix completion with fixed basis coefficients
Integer programming models for feature selection: new extensions and a randomized solution algorithm
Feature selection for support vector machines via mixed integer linear programming
Supersparse linear integer models for optimized medical scoring systems
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
Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
Lagrangian relaxation for SVM feature selection
DC formulations and algorithms for sparse optimization problems
Logistic regression: from art to science
Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
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
Slope meets Lasso: improved oracle bounds and optimality
Feature selection in SVM via polyhedral $k$-norm
A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
A DC programming approach for feature selection in support vector machines learning
Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions
Decoding by Linear Programming
Feature Selection via Mathematical Programming
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
10.1162/153244303322753616
10.1162/153244303322753751
Deforming $||.||_{1}$ into $||.||_{\infty}$ via Polyhedral Norms: A Pedestrian Approach
Minimization of $\ell_{1-2}$ for Compressed Sensing
Stable signal recovery from incomplete and inaccurate measurements
Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
Compressed sensing

This page was built for publication: Sparse optimization via vector $k$-norm and DC programming with an application to feature selection for support vector machines

Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines