SymDPoly:非交换多项式优化的自适应矩松弛算法
SymDPoly: symmetry-adapted moment relaxations for noncommutative polynomial optimization
摘要:
半定松弛法被广泛用于计算非交换多项式优化问题的目标上界。这样的优化问题在量子信息中是普遍存在的。我们提出了一个算法,能够自动发现和利用的对称性存在的问题制定。我们还提供了一个用Scala编写的开源软件库(https://denisrosset.github.io/symdpoly),该软件库计算自适应半定松弛,并与各种开源和商业半定解算器接口。我们讨论了对称化的优点,即减少内存使用,计算时间,并增加解决方案的精度。
英文摘要:
Semidefinite relaxations are widely used to compute upper bounds on the objective of optimization problems involving noncommutative polynomials. Such optimization problems are prevalent in quantum information. We present an algorithm able to discover automatically and exploit the symmetries present in the problem formulation. We also provide an open source software library written in Scala ( https://denisrosset.github.io/symdpoly ) that computes symmetry-adapted semidefinite relaxations with interfaces to a variety of open-source and commercial semidefinite solvers. We discuss the advantages of symmetrization, namely reductions in memory use, computation time, and increase in the solution precision.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。