Project Details
Projekt Print View

Spectrahedra and Hyperbolic Polynomials

Subject Area Mathematics
Term from 2019 to 2022
Project identifier Deutsche Forschungsgemeinschaft (DFG) - Project number 421473641
 
Final Report Year 2023

Final Report Abstract

Semidefinite programming is a branch of convex optimization that has aroused great interest both theoretically and practically. Typical applications include polynomial optimization or combinatorial optimization, such as the Max-Cut Problem. With the help of interior-point method one can solve a semidefinite program for fixed precision in a time that is polynomial in the program description size. A question of fundamental interest is that of characterizing the sets which are the feasible sets of semidefinite programming, namely the so-called spectrahedra. The content of the generalized Lax conjecture is such a presumed characterization. The results achieved in this project include several positive partial results towards this conjecture as well as the development of some techniques that might lead to a counter example.

Publications

 
 

Additional Information

Textvergrößerung und Kontrastanpassung