In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (Evans-Steuer) algorithm [12]. Different from it, the proposed algorithm works in the parameter space and does not aim to find the set of all efficient solutions. Instead, it finds a solution in the sense of Loehne [16], that is, it finds a subset of efficient solutions that allows to generate the whole frontier. In that sense, it can also be seen as a generalization of the parametric self-dual simplex algorithm, which originally is designed for solving single objective linear optimization problems, and is modified to solve two objective bounded LVOPs with the positive orthant as the ordering cone in Ruszczynski and Vanderbei [21]. The algorithm proposed here works for any dimension, any solid pointed polyhedral ordering cone C and for bounded as well as unbounded problems. Numerical results are provided to compare the proposed algorithm with an objective space based LVOP algorithm (Benson algorithm in [13]), that also provides a solution in the sense of [16], and with Evans-Steuer algorithm [12]. The results show that for non-degenerate problems the proposed algorithm outperforms Benson algorithm and is on par with Evan-Steuer algorithm. For highly degenerate problems Benson's algorithm [13] excels the simplex-type algorithms; however, the parametric simplex algorithm is for these problems computationally much more efficient than Evans-Steuer algorithm.
Volume of slices and sections of the simplex in closed form
给定一个向量a $\in$ Rn,我们给出了单形δ的截面积δ $\cap$ {x:a T x \textless{} = t}和切片积$\cap$ {x:a T x = t},t $\in$ R的公式的另一种直接证明.对于切片的公式已经推导出来,但作为一元B样条构造的副产品。本文的目的之一是也显示如何简单和强大的拉普拉斯变换技术,以获得封闭形式的一些多元积分的表达。它也补充了以前关于超立方体[0,1] n的一些结果。
A Robust Twin Parametric Margin Support Vector Machine for Multiclass Classification
School of Science and Technology, University of Camerino(科学与技术学院,坎皮诺大学);Department of Management, Information and Production Engineering, University of Bergamo(管理、信息与生产工程系,贝拉姆多大学)