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

求解双曲规划的高效算法

Efficient Algorithm for Solving Hyperbolic Programs

Yichuan Deng, Zhao Song, Lichen Zhang, Ruizhe Zhang

AI总结:

本研究针对双曲规划问题,提出一种基于中心带的内点法高效算法,通过松弛为二次规划并结合双曲特征值前四阶矩优化方向,在给定多项式求值预言机下达到较低的预言机调用与算术运算复杂度。

摘要:

双曲多项式是一类具有实根的多项式,在理论计算机科学中有着广泛的应用。每个双曲多项式还会诱导出一个双曲锥,由于其普适性,该锥在优化领域备受关注——只要恰当选择多项式,就能轻松推导出线性规划、半定规划等经典优化问题。在本研究中,我们针对双曲规划问题开发了高效算法,该问题的目标是在一组线性约束下最小化线性目标函数,且解必须位于由双曲多项式诱导的双曲锥内。我们的算法属于内点法(IPM)的一种实例,但它并非遵循中心路径,而是遵循中心带(central Swath)——这是中心路径的一种推广形式。为高效实现该内点法,我们将双曲规划松弛为二次规划,并结合双曲特征值的前四阶矩,这些矩对于更新优化方向至关重要。我们进一步证明,在给定多项式的求值预言机(evaluation oracle)的条件下,我们的算法仅需$O(n^2d^{2.5})$次预言机调用,其中$n$为变量数量,$d$为多项式的次数,此外还需要$O((n+m)^3 d^{0.5})$次算术运算,其中$m$为约束数量。

英文摘要:

Hyperbolic polynomials is a class of real-roots polynomials that has wide range of applications in theoretical computer science. Each hyperbolic polynomial also induces a hyperbolic cone that is of particular interest in optimization due to its generality, as by choosing the polynomial properly, one can easily recover the classic optimization problems such as linear programming and semidefinite programming. In this work, we develop efficient algorithms for hyperbolic programming, the problem in each one wants to minimize a linear objective, under a system of linear constraints and the solution must be in the hyperbolic cone induced by the hyperbolic polynomial. Our algorithm is an instance of interior point method (IPM) that, instead of following the central path, it follows the central Swath, which is a generalization of central path. To implement the IPM efficiently, we utilize a relaxation of the hyperbolic program to a quadratic program, coupled with the first four moments of the hyperbolic eigenvalues that are crucial to update the optimization direction. We further show that, given an evaluation oracle of the polynomial, our algorithm only requires $O(n^2d^{2.5})$ oracle calls, where $n$ is the number of variables and $d$ is the degree of the polynomial, with extra $O((n+m)^3 d^{0.5})$ arithmetic operations, where $m$ is the number of constraints.

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

↑