求解互补支持向量机的非单调信赖域算法  

A non-monotonic trust region algorithm for solving complementary support vector machine

作　　者：高雷阜[1] 于冬梅[1] 赵世杰[1] 

机构地区：[1]辽宁工程技术大学优化与决策研究所,辽宁阜新123000

出　　处：《计算机工程与科学》2015年第6期1142-1147,共6页Computer Engineering & Science

基　　金：教育部高校博士学科科研基金联合资助项目(20132121110009)

摘　　要：求解支持向量机的核心问题是对一个大规模凸二次规划问题进行求解。基于支持向量机的修正模型,得到一个与之等价的互补问题,利用Fischer-Burmeister互补函数,从一个新的角度提出了求解互补支持向量机的非单调信赖域算法。新算法避免了求解Hesse矩阵或矩阵求逆运算,减少了工作量,提高了运算效率。在不需要任何假设的情况下,证明算法具有全局收敛性。数值实验结果表明,对于大规模非线性分类问题,该算法的运行速度比LSVM算法和下降法快,为求解SVM优化问题提供了一种新的可行方法。Solving a large-scale convex quadratic programming problem is the core of the support vector machine. An equivalence complementarity problem can be obtained based on an amended model of the surpport vector machine（SVM）, therefore we propose a non-monotonic trust region algorithm for solving the complementarity problem based on the Fischer-Burmeister complementarity function. The new algorithm need not compute any Hesse or the inverse matrix, thus reducing the amount of computa- tional work. Global convergence of the algorithm is proved without any assumptions. Numerical experi- ments show that the running speed of the algorithm is faster than that of the LSVM algorithm and the descent algorithm when solving large-scale nonlinear classification problems and thus it provides a feasible method for solving SVM.

关 键 词：支持向量机 信赖域方法 互补函数 非单调策略 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]