一种类似Weiszfeld的算法用于约束到闭凸集的Weber选址问题
A Weiszfeld-like algorithm for a Weber location problem constrained to a closed and convex set
AI总结:
针对约束到闭凸集的Weber选址问题,提出一种类似Weiszfeld的算法,该算法基于正交投影和改进的Weiszfeld迭代函数,生成的序列具有下降性质,并在一定假设下收敛到KKT点。
摘要:
Weber问题是在$\mathbbm{R}^n$中寻找一点,使得该点到$\mathbbm{R}^n$中$m$个非共线点的加权距离之和最小。该问题的一个应用是二维情况下的设施最优选址。1937年Weiszfeld提出了一种基于不动点迭代的经典方法来解决Weber问题。本文考虑约束到闭凸集的Weber问题,提出了一种类似Weiszfeld的算法,该算法即使在迭代点为顶点时也有良好定义。所提算法的迭代函数$Q$主要基于可行集上的正交投影,并结合了Vardi和Zhang在2001年提出的改进Weiszfeld算法的迭代函数。可以看出,所提算法生成一系列可行迭代点,具有下降性质。在一定假设下,该序列的极限满足KKT最优性条件,是定义算法的迭代函数的不动点,并且是约束最小化问题的解。数值实验证实了理论结果。
英文摘要:
The Weber problem consists of finding a point in $\mathbbm{R}^n$ that minimizes the weighted sum of distances from $m$ points in $\mathbbm{R}^n$ that are not collinear. An application that motivated this problem is the optimal location of facilities in the 2-dimensional case. A classical method to solve the Weber problem, proposed by Weiszfeld in 1937, is based on a fixed point iteration. In this work a Weber problem constrained to a closed and convex set is considered. A Weiszfeld-like algorithm, well defined even when an iterate is a vertex, is presented. The iteration function $Q$ that defines the proposed algorithm, is based mainly on an orthogonal projection over the feasible set, combined with the iteration function of a modified Weiszfeld algorithm presented by Vardi and Zhang in 2001. It can be seen that the proposed algorithm generates a sequence of feasible iterates that have descent properties. Under certain hypotheses, the limit of this sequence satisfies the KKT optimality conditions, is a fixed point of the iteration function that defines the algorithm, and is the solution of the constrained minimization problem. Numerical experiments confirmed the theoretical results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。