广义多源Weber问题的定性分析与自适应Boosted DCA
Qualitative Analysis and Adaptive Boosted DCA for Generalized Multi-Source Weber Problems
AI总结：
本文研究广义多源Weber问题的定性性质，并应用Nesterov平滑与自适应BDCA求解，通过与现有方法比较验证其效率。
摘要：
本文有两个主要目标。首先，我们研究了使用Minkowski规范函数表述的广义多源Weber问题的基本定性性质，包括证明全局最优解的存在性、证明解集的紧性以及建立这些解的最优性条件。其次，我们应用Nesterov平滑和自适应Boosted Difference of Convex functions算法（BDCA）来求解广义多源Weber问题的无约束和约束版本。这些算法建立在[6,19]中提出的工作基础上。我们对自适应BDCA进行了全面评估，将其性能与[19]中提出的方法进行比较，并对其效率提供了见解。
英文摘要：
This paper has two primary objectives. First, we investigate fundamental qualitative properties of the generalized multi-source Weber problem formulated using the Minkowski gauge function. This includes proving the existence of global optimal solutions, demonstrating the compactness of the solution set, and establishing optimality conditions for these solutions. Second, we apply Nesterov's smoothing and the adaptive Boosted Difference of Convex functions Algorithm (BDCA) to solve both the unconstrained and constrained versions of the generalized multi-source Weber problems. These algorithms build upon the work presented in [6,19]. We conduct a comprehensive evaluation of the adaptive BDCA, comparing its performance to the method proposed in [19], and provide insights into its efficiency.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
