Feature selection in machine learning: an exact penalty approach using a Difference of Convex function Algorithm

Sparse high-dimensional fractional-norm support vector machine via DC programming

(2013) Wei Guan et al.   COMPUTATIONAL STATISTICS & DATA ANALYSIS

Learning sparse classifiers with difference of convex functions algorithms

(2012) Cheng Soon Ong et al.   OPTIMIZATION METHODS & SOFTWARE

Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization

(2012) Xiaojun Chen et al.   SIAM JOURNAL ON SCIENTIFIC COMPUTING

$\ell_{p}-\ell_{q}$ Penalty for Sparse Linear and Sparse Multiple Kernel Multitask Learning

(2011) A. Rakotomamonjy et al.   IEEE TRANSACTIONS ON NEURAL NETWORKS

Exact penalty and error bounds in DC programming

(2011) Hoai An Le Thi et al.   JOURNAL OF GLOBAL OPTIMIZATION

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

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

Smoothly Clipped Absolute Deviation on High Dimensions

(2009) Yongdai Kim et al.   JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION

One-step sparse estimates in nonconcave penalized likelihood models

(2008) Hui Zou et al.   ANNALS OF STATISTICS

Asymptotic properties of bridge estimators in sparse high-dimensional regression models

(2008) Jian Huang et al.   ANNALS OF STATISTICS

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

A bilinear formulation for vector sparsity optimization

(2007) Dori Peleg et al.   SIGNAL PROCESSING