Sixth order polynomial smoothing approximation solution to support vector machine

Yubo Yuan, Dongmei Pu, Feilong Cao

Abstract: Support vector machine (SVM) can be seen as a special binary classification method. The original model is a quadratical programming with linear inequalities constraints. It is a very important issue that how to get the optimal solution of SVM model. In this paper, a new solution method is proposed. The constraints are moved away from the original optimization model by using the approximation solution in the feasible space. Three points under one control parameter smoothing function is used to smoothen the objective function of unconstrained model. It is a sixth order polynomial function. The smoothing performance is investigated. By theory proof, the proposed unconstrained model has an active performance which can be controlled by one proposed parameter.