Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety

• 成果类型: Article; Early Access
• 署名作者: Hua, Zheng; Qu, Zheng
• 署名单位: University of Hong Kong; Shenzhen University
• 刊物名称: MATHEMATICS OF OPERATIONS RESEARCH
• ISSN/ISSBN: 0364-765X
• DOI: 10.1287/moor.2024.0483
• 发表日期: 2025
• 关键词: positive polynomials; REPRESENTATIONS; squares; SUM; hierarchy

摘要

In this paper, we address the effective degree bound problem for Lasserre's hierarchy of moment-sum-of-squares (SOS) relaxations in polynomial optimization involving n variables. We assume that the first n equality constraint polynomials g1, ... ,gn do not share any nontrivial common complex zero locus at infinity and that the optimal solutions are nonsingular. Under these conditions, we derive an effective degree bound for the exactness of Lasserre's hierarchy. Importantly, the assumption of no solutions at infinity holds on a Zariski open set within the space of polynomials of fixed degrees. As a direct consequence, we provide the first explicit degree bound for gradient-type SOS relaxation under a generic condition.