Noncommutative Polynomial Optimization

2021/09/02 by Abhishek Bhardwaj, Igor Klep, Bhardwaj, Abhishek +3
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Commutative Algebra and Its Applications #FOS: Mathematics #Optimization and Control (math.OC) #Polynomial and algebraic computation

paper · doi:10.48550/arxiv.2109.00786

openalex publication_date 2021/09/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this chapter we present the sums of Hermitian squares approach to noncommutative polynomial optimization problems. This is an extension of the sums of squares approach for polynomial optimization arising from real algebraic geometry. We provide a gentle introduction to the underlying theory of this methodology and highlight its importance.

Related

• Optimization over Nonnegative and Convex Polynomials With and Without Semidefinite Programming
• Sum of squares generalizations for conic sets
• Upper bound hierarchies for noncommutative polynomial optimization
• An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
• Sum-of-squares optimization without semidefinite programming