Noncommutative Polynomial Optimization
Abhishek Bhardwaj, Igor Klep, Victor Magron

TL;DR
This paper introduces a method for optimizing noncommutative polynomials using sums of Hermitian squares, extending classical algebraic techniques to noncommutative settings with theoretical insights.
Contribution
It extends the sums of squares approach from real algebraic geometry to noncommutative polynomial optimization, providing foundational theory and highlighting its significance.
Findings
Framework for noncommutative polynomial optimization
Extension of sums of squares methodology
Theoretical foundation for practical applications
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Polynomial and algebraic computation · Commutative Algebra and Its Applications
