J4 ›› 2013, Vol. 51 ›› Issue (03): 403-407.

Previous Articles     Next Articles

SMOType Algorithm for Solving the WeightedEuclidean OneCenter Problem

CONG Weijie   

  1. School of Science, Xi’an University of Posts and Telecommunications, Xi’an 710121, China
  • Received:2012-08-11 Online:2013-05-26 Published:2013-05-17
  • Contact: CONG Weijie E-mail:wjcong@xupt.edu.cn

Abstract:

Two approximate optimality conditions of the weighted Euclidean onecenter (WEOC) problem were defined. Based on the idea of sequential minimal optimization (SMO) method, an SMOtype algorithm for the WEOC problem was proposed. By means of this algorithm, a (1+ε)approximate solution of the WEOC problem was computed, which satisfys the second approximate optimality condition. At each iteration, it updates only two components of the dual variable. The numerical results show the proposed SMOtype algorithm is simple to implement, can effectively solve largescale problem with a high degree of accuracy.

Key words: weighted Euclidean onecenter, sequential minimal optimization, optimality condition, approximation algorithm

CLC Number: 

  • O221.2