arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.07119math.OC
收藏

凸向量最优化问题的外逼近算法

Outer approximation algorithms for convex vector optimization problems

Irem Nur Keskin, Firdevs Ulus

摘要:

在这项研究中,我们提出了一个通用的框架外近似算法来解决凸向量最优化问题,其中的Pascoletti-Serafini(PS)标量化迭代求解。这种标量化找到了从参考点(通常被视为当前外部近似的顶点)通过给定方向到上部图像的最小“距离”。我们提出了有效的方法来选择参数(参考点和方向向量)的PS标量和分析这些对算法的整体性能的影响。与文献中已有的顶点选择规则不同,该方法不需要求解额外的单目标最优化问题。使用一些测试问题,我们进行了广泛的计算研究,其中三个不同的措施设置为停止标准:近似误差,运行时间,和解决方案集的基数。我们观察到,所提出的变种有令人满意的结果,特别是在运行时间相比,现有的变种从文献。

英文摘要:

In this study, we present a general framework of outer approximation algorithms to solve convex vector optimization problems, in which the Pascoletti-Serafini (PS) scalarization is solved iteratively. This scalarization finds the minimum 'distance' from a reference point, which is usually taken as a vertex of the current outer approximation, to the upper image through a given direction. We propose efficient methods to select the parameters (the reference point and direction vector) of the PS scalarization and analyze the effects of these on the overall performance of the algorithm. Different from the existing vertex selection rules from the literature, the proposed methods do not require solving additional single-objective optimization problems. Using some test problems, we conduct an extensive computational study where three different measures are set as the stopping criteria: the approximation error, the runtime, and the cardinality of solution set. We observe that the proposed variants have satisfactory results especially in terms of runtime compared to the existing variants from the literature.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑