Feature selection in SVM via polyhedral k-norm

Minimizing Piecewise-Concave Functions Over Polyhedra

(2018) Manlio Gaudioso et al.   MATHEMATICS OF OPERATIONS RESEARCH

Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations

(2017) Manlio Gaudioso et al.   JOURNAL OF GLOBAL OPTIMIZATION

DC formulations and algorithms for sparse optimization problems

(2017) Jun-ya Gotoh et al.   MATHEMATICAL PROGRAMMING

A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization

(2017) Emmanuel Soubies et al.   SIAM JOURNAL ON OPTIMIZATION

Integer programming models for feature selection: New extensions and a randomized solution algorithm

(2016) P. Bertolazzi et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes

(2016) Kaisa Joki et al.   JOURNAL OF GLOBAL OPTIMIZATION

Sparse learning via Boolean relaxations

(2015) Mert Pilanci et al.   MATHEMATICAL PROGRAMMING

Feature selection for Support Vector Machines via Mixed Integer Linear Programming

(2014) Sebastián Maldonado et al.   INFORMATION SCIENCES

On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions

(2014) Bin Wu et al.   SIAM JOURNAL ON OPTIMIZATION

Accelerated Block-coordinate Relaxation for Regularized Optimization

(2012) Stephen J. Wright   SIAM JOURNAL ON OPTIMIZATION

Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming

(2009) G. Gasso et al.   IEEE TRANSACTIONS ON SIGNAL PROCESSING

Concave programming for minimizing the zero-norm over polyhedral sets

(2008) F. Rinaldi et al.   COMPUTATIONAL OPTIMIZATION AND APPLICATIONS

A DC programming approach for feature selection in support vector machines learning

(2008) Hoai An Le Thi et al.   Advances in Data Analysis and Classification