An Efficient ADMM-Based Algorithm to Nonconvex Penalized Support Vector Machines

11 Sep 2018 • Lei Guan • Linbo Qiao • Dongsheng Li • Tao Sun • Keshi Ge • Xicheng Lu

Support vector machines (SVMs) with sparsity-inducing nonconvex penalties have received considerable attentions for the characteristics of automatic classification and variable selection. However, it is quite challenging to solve the nonconvex penalized SVMs due to their nondifferentiability, nonsmoothness and nonconvexity... (read more)

PDF Abstract

Results from the Paper

Edit

Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

METHOD	TYPE
🤖 No Methods Found	Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet

An Efficient ADMM-Based Algorithm to Nonconvex Penalized Support Vector Machines

Code

Add Remove Mark official

Tasks

Add Remove

Results from the Paper

Edit

Methods used in the Paper

Add Remove

An Efficient ADMM-Based Algorithm to Nonconvex Penalized Support Vector Machines

Code Edit Add Remove Mark official

Tasks Edit Add Remove

Results from the Paper Edit

Methods used in the Paper Edit Add Remove

Code

Add Remove Mark official

Tasks

Add Remove

Results from the Paper

Edit

Methods used in the Paper

Add Remove