Abstract
The study of matrix inequalities in a dimension-free setting is in the realm of free real algebraic geometry. In this paper we investigate constrained trace and eigenvalue optimization of noncommutative polynomials. We present Lasserre's relaxation scheme for trace optimization based on semidefinite programming (SDP) and demonstrate its convergence properties. Finite convergence of this relaxation scheme is governed by flatness, i.e., a rank-preserving property for associated dual SDPs. If flatness is observed, then optimizers can be extracted using the Gelfand---Naimark---Segal construction and the Artin---Wedderburn theory verifying exactness of the relaxation. To enforce flatness we employ a noncommutative version of the randomization technique championed by Nie. The implementation of these procedures in our computer algebra system NCSOStoolsis presented and several examples are given to illustrate our results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
