Operations Research Transactions ›› 2020, Vol. 24 ›› Issue (3): 115-126.doi: 10.15960/j.cnki.issn.1007-6093.2020.03.009

Previous Articles     Next Articles

Sparse proximal support vector machines via DC programming

YANG Linxi, LI Guoquan*   

  1. School of Mathematical Sciences, Chongqing Normal University, Chongqing 401331, China
  • Received:2019-12-13 Published:2020-09-05

Abstract: To improve the performance of proximal support vector machine, a new sparse proximal support vector machine is proposed in this paper where $\ell_0$-norm regularization is used to improve the feature selection ability of the new model. However, problem with $\ell_0$-norm regularization usually is NP-hard. To overcome this difficulty, a continuous nonconvex function is used to approximate $\ell_0$-norm. With proper DC decomposition, we transform the problem into a DC programming problem which can be solved efficiently by DC algorithm. Meanwhile, we also discuss the convergence properties of our algorithm. The experimental results on both simulated and real datasets demonstrate the efficiency of the proposed algorithms.

Key words: proximal support vector machine, sparse optimization, difference of convex functions programming, feature selection

CLC Number: