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

凸分析下的Fermat-Torricelli问题和Weiszfeld算法

The Fermat-Torricelli Problem and Weiszfeld's Algorithm in the Light of Convex Analysis

Boris Mordukhovich, Nguyen Mau Nam

摘要:

在17世纪初,皮埃尔·德·费马提出了以下问题:给定平面上的三个点,找到一个点,使得它到这三个点的欧氏距离之和最小。这个问题是解决了埃万杰利斯塔托里切利和被命名为{ \em费马托里切利问题}。费马-托里切利问题的一个更一般的版本要求一个点,该点使到$\Bbb R^n$中有限个给定点的距离之和最小。这是区位科学的主要问题之一。本文利用凸分析和最优化的一些方法,从理论和数值两个方面重新研究了Fermat-Torricelli问题。

英文摘要:

In the early 17th century, Pierre de Fermat proposed the following problem: given three points in the plane, find a point such that the sum of its Euclidean distances to the three given points is minimal. This problem was solved by Evangelista Torricelli and was named the {\em Fermat-Torricelli problem}. A more general version of the Fermat-Torricelli problem asks for a point that minimizes the sum of the distances to a finite number of given points in $\Bbb R^n$. This is one of the main problems in location science. In this paper we revisit the Fermat-Torricelli problem from both theoretical and numerical viewpoints using some ingredients of convex analysis and optimization.

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

↑