吉林大学学报(理学版) ›› 2018, Vol. 56 ›› Issue (6): 1373-1378.

• 数学 • 上一篇    下一篇

求解加权最小闭包球问题的列生成算法

丛伟杰, 孙绘   

  1. 西安邮电大学 理学院, 西安 710121
  • 收稿日期:2017-11-17 出版日期:2018-11-26 发布日期:2018-11-26
  • 通讯作者: 孙绘 E-mail:sun_hui_1993@163.com

Column Generation Algorithm for Solving WeightedMinimum Enclosing Ball Problem#br#

CONG Weijie, SUN Hui   

  1. School of Science, Xi’an University of Posts and Telecommunications, Xi’an 710121, China
  • Received:2017-11-17 Online:2018-11-26 Published:2018-11-26

摘要: 先建立求解加权最小闭包球(WMEB)问题的序列最小最优化(SMO)算法的线性收敛性, 再结合列生成算法的思想, 即每次迭代将与当前球
心加权距离最远的点加到核心集中, 并调用SMO算法, 提出一种求解WMEB问题的列生成算法. 数值实验结果表明, 该算法能有效提高求解大规模数据集上WMEB问题的计算效率.

关键词: 加权最小闭包球, 线性收敛性, 列生成算法, 大规模数据集

Abstract: Firstly, the linear convergence of sequential minimal optimization (SMO) algorithm for solving the weighted minimum enclosing ball (WMEB) problem was established. Secondly, by incorporating the idea of column generation algorithm into the SMO algorithm, we proposed a column generation algorithm for solving the WMEB problem. The algorithm added the furthest point of weighted distance from the current ball center to  the core set at each iteration. The results of numerical experiments show that the proposed algorithm can effectively improve the computational efficiency of solving the WMEB problem on large
scale data sets.

Key words: weighted minimum enclosing ball (WMEB), linear convergence,  , column generation algorithm, largescale data set

中图分类号: 

  • O221.2