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

一般化的腰问题:最优性条件与算法

A Generalized Waist Problem: Optimality Condition and Algorithm

Deen Dayal Upadhyaya Gorakhpur University(迪恩·达亚尔·乌帕迪亚亚戈拉克普尔大学);Dr. Hari Singh Gour Vishwavidyalaya(哈里·辛格·古尔博士维斯瓦维达亚拉大学)

Triloki Nath, Manohar Choudhary, Ram K. Pandey

AI总结:

本文提出了一种一般化的腰问题,通过闭合多边形曲线连接凸集以最小化距离之和,并推导了最优性条件和收敛的投影子梯度下降算法。

摘要:

许多年前,伦敦国王学院的约翰·泰勒尔教授向他的博士生提出了一个谜题:证明存在一个唯一三角形,其周长最小,且恰好有一个顶点位于三条给定的直线上,这三条直线两两不相交且不全平行。文献中的这个问题被称为“腰问题”,而只有凸性在此情况下得以拯救。受此启发,我们将其推广,将直线替换为欧几里得空间中的若干凸集,并通过闭合多边形曲线连接这些集合,以最小化连接它们的距离之和。这个推广的问题在现代凸分析的几何和实际应用范围上有了显著扩展。我们建立了解的存在性,并在至少一个凸集严格凸且所有集合处于一般位置的条件下证明了其唯一性:每个集合都可以由其他集合的凸包分离。我们推导出了一套完整的必要和充分最优性条件,并探讨了它们的几何解释,以将这些条件与经典原理如光的反射定律联系起来。为了解决这个问题,我们开发了一种投影子梯度下降方法,并证明了其收敛性。我们的算法通过详细的数值实验得到支持,特别是在涉及圆盘和球体的案例中。此外,我们以“岛屿间连通性”形式呈现了该问题的实际类比,展示了其实际相关性。这项工作不仅推进了几何优化理论,还为设施选址、网络设计、机器人学、计算几何和空间规划等应用提供了有效的方法和见解。

英文摘要:

Many years ago John Tyrell a lecturer at King's college London challenged his Ph.D. students with the following puzzle: show that there is a unique triangle of minimal perimeter with exactly one vertex to lie on one of three given lines, pairwise disjoint and not all parallel in the space. The problem in literature is known as the waist problem, and only convexity rescued in this case. Motivated by this we generalize it by replacing lines with a number of convex sets in the Euclidean space and ask to minimize the sum of distances connecting the sets by means of closed polygonal curve. This generalized problem significantly broadens its geometric and practical scope in view of modern convex analysis. We establish the existence of solutions and prove its uniqueness under the condition that at least one of the convex sets is strictly convex and all are in general position: each set can be separated by convex hull of others. A complete set of necessary and sufficient optimality conditions is derived, and their geometric interpretations are explored to link these conditions with classical principles such as the reflection law of light. To address this problem computationally, we develop a projected subgradient descent method and prove its convergence. Our algorithm is supported by detailed numerical experiments, particularly in cases involving discs and spheres. Additionally, we present a real-world analogy of the problem in the form of inter-island connectivity, illustrating its practical relevance. This work not only advances the theory of geometric optimization but also contributes effective methods and insights applicable to facility location, network design, robotics., computational geometry, and spatial planning.

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

↑