arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.09307math.OCcs.CCcs.DScs.SYeess.SYmath.AG
收藏

关于基于全局正性证书的多项式优化收敛层级构造

On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity

Princeton(普林斯顿大学)

Amir Ali Ahmadi, Georgina Hall

AI总结:

本文提出基于早期20世纪的正性证书构建多项式优化收敛层级的方法,利用Artin解和Polyá结果,实现无需优化的收敛层级,生成新的线性规划和二次锥规划层级。

摘要:

近年来,基于凸优化和实代数的收敛层级技术在多项式最优化问题中变得流行。这些层级的核心依赖于20世纪后期的正性定理(如Stengle、Putinar或Schmüdgen)来证明多项式在任意闭基本半代数集上的正性。本文证明,实际上可以基于更有限的、回溯到20世纪初的正性定理来设计层级,这些定理仅证明多项式的全局正性。更具体地说,我们证明任何对正齐次多项式锥的内近似,只要足够紧密,都可以转化为一般多项式最优化问题的收敛下界层级。这尤其导致了一个基于半正定规划的层级,仅依赖于Artin对Hilbert第17问题的解。我们还利用Polyá关于偶形式全局正性的经典结果,构建了一个

英文摘要:

In recent years, techniques based on convex optimization and real algebra that produce converging hierarchies of lower bounds for polynomial minimization problems have gained much popularity. At their heart, these hierarchies rely crucially on Positivstellensätze from the late 20th century (e.g., due to Stengle, Putinar, or Schmüdgen) that certify positivity of a polynomial on an arbitrary closed basic semialgebraic set. In this paper, we show that such hierarchies could in fact be designed from much more limited Positivstellensätze dating back to the early 20th century that only certify positivity of a polynomial globally. More precisely, we show that any inner approximation to the cone of positive homogeneous polynomials that is arbitrarily tight can be turned into a converging hierarchy of lower bounds for general polynomial minimization problems with compact feasible sets. This in particular leads to a semidefinite programming-based hierarchy that relies solely on Artin's solution to Hilbert's 17th problem. We also use a classical result of Polyá on global positivity of even forms to construct an "optimization-free" converging hierarchy for general polynomial minimization problems. This hierarchy only requires polynomial multiplication and checking nonnegativity of coefficients of certain fixed polynomials. As a corollary, we obtain new linear programming and second-order cone programming-based hierarchies for polynomial minimization problems that rely on the recently introduced concepts of dsos and sdsos polynomials. We remark that the scope of this paper is theoretical at this stage as our hierarchies-though they involve at most two sum of squares constraints or only basic arithmetic at each level-require the use of bisection and increase the number of variables (resp. degree) of the problem by the number of inequality constraints plus three (resp. by a factor of two).

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

↑