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

拉格朗日对偶截面:隐藏凸性的拓扑视角

Lagrangian Dual Sections: A Topological Perspective on Hidden Convexity

California Institute of Technology(加州理工学院);University of Missouri-Columbia(密苏里大学哥伦比亚分校);University of Wisconsin-Madison(威斯康星大学麦迪逊分校)

Venkat Chandrasekaran, Timothy Duff, Jose Israel Rodriguez, Kevin Shu

AI总结:

本文从拓扑视角提出拉格朗日对偶截面概念,为非凸优化问题给出隐藏凸性的充分条件,并在谱反问题、Stiefel流形优化及不平衡Procrustes问题中推广统一了已有结果,同时提出黎曼流形上的全局优化算法。

摘要:

隐藏凸性是优化中一个强有力的思想:在适当的变换下,看似难以处理的非凸问题可以利用凸优化高效求解。我们引入定义在拓扑空间上的非线性规划的拉格朗日对偶截面的概念,并利用它给出非凸优化问题具有自然凸重构的充分条件。我们强调该框架的拓扑性质,仅利用问题某种拉格朗日表述的连续性和连通性性质来证明结果。我们在一系列应用中展示了该框架的实际后果,并发展了新的算法方法。首先,我们给出了在谱反问题背景下可转化为凸规划的若干非凸问题实例族——其中包括二次约束二次优化和Stiefel流形优化作为特例——以及不平衡Procrustes问题。在这些应用中,我们既推广了先前关于隐藏凸性的结果,又提供了统一的证明。对于谱反问题的情况,我们还提出了一种李理论方法,说明了与Kostant凸性定理的联系。其次,我们引入了新的算法思想,当底层拓扑空间为黎曼流形时,可用于寻找优化问题的两种拉格朗日形式以及约束优化问题的全局最优解。

英文摘要:

Hidden convexity is a powerful idea in optimization: under the right transformations, nonconvex problems that are seemingly intractable can be solved efficiently using convex optimization. We introduce the notion of a Lagrangian dual section of a nonlinear program defined over a topological space, and we use it to give a sufficient condition for a nonconvex optimization problem to have a natural convex reformulation. We emphasize the topological nature of our framework, using only continuity and connectedness properties of a certain Lagrangian formulation of the problem to prove our results. We demonstrate the practical consequences of our framework in a range of applications and by developing new algorithmic methodology. First, we present families of nonconvex problem instances that can be transformed to convex programs in the context of spectral inverse problems -- which include quadratically constrained quadratic optimization and Stiefel manifold optimization as special cases -- as well as unbalanced Procrustes problems. In each of these applications, we both generalize prior results on hidden convexity and provide unifying proofs. For the case of the spectral inverse problems, we also present a Lie-theoretic approach that illustrates connections with the Kostant convexity theorem. Second, we introduce new algorithmic ideas that can be used to find globally optimal solutions to both Lagrangian forms of an optimization problem as well as constrained optimization problems when the underlying topological space is a Riemannian manifold.

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

↑