A formula for the algebraic degree in semidefinite programming
Dang Tuan Hiep
TL;DR
This paper derives a formula for the algebraic degree in semidefinite programming using the Bott residue formula in equivariant cohomology, providing a new mathematical approach to understanding the complexity of these problems.
Contribution
It introduces a novel application of the Bott residue formula to compute the algebraic degree in semidefinite programming.
Findings
Derived a closed-form formula for algebraic degree
Applied equivariant cohomology techniques to optimization problems
Provides a new theoretical tool for analyzing semidefinite programs
Abstract
In this paper we use the Bott residue formula in equivariant cohomology to show a formula for the algebraic degree in semidefinite programming.
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.