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

基于次正规性的Optimization算法及插值

Algorithm for Optimization and Interpolation based on Hyponormality

Cédric Josz

摘要:

一方面,考虑找到多项式最优化问题的全局解的问题,另一方面,考虑用复指数函数插值一组点的问题。本文提出了一个单一的算法来解决这两个问题。它借鉴了算子理论中的亚正规性概念。关于优化,它似乎是第一个能够从变量和数据是复数的多项式最优化问题中提取全局解的算法。它也适用于实多项式优化,复多项式优化的特殊情况,从而扩展了Henrion和Lasserre在GloptiPoly中实现的工作。在插值方面,该算法提供了一种基于Autonne-Takagi分解的Prony方法的替代方案,并且避免了求解Vandermonde系统。算法及其证明完全基于线性代数。它们没有代数几何的概念,与现有的插值方法相反。该算法进行了测试的一系列例子,每个说明了不同方面的方法。其中一个例子表明,亚正规性可以在数值上加强凸松弛,并迫使其解具有秩1。

英文摘要:

On one hand, consider the problem of finding global solutions to a polynomial optimization problem and, on the other hand, consider the problem of interpolating a set of points with a complex exponential function. This paper proposes a single algorithm to address both problems. It draws on the notion of hyponormality in operator theory. Concerning optimization, it seems to be the first algorithm that is capable of extracting global solutions from a polynomial optimization problem where the variables and data are complex numbers. It also applies to real polynomial optimization, a special case of complex polynomial optimization, and thus extends the work of Henrion and Lasserre implemented in GloptiPoly. Concerning interpolation, the algorithm provides an alternative to Prony's method based on the Autonne-Takagi factorization and it avoids solving a Vandermonde system. The algorithm and its proof are based exclusively on linear algebra. They are devoid of notions from algebraic geometry, contrary to existing methods for interpolation. The algorithm is tested on a series of examples, each illustrating a different facet of the approach. One of the examples demonstrates that hyponormality can be enforced numerically to strenghten a convex relaxation and to force its solution to have rank one.

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

↑