Sabine Burgdorf
Centrum Wiskunde & Informatica
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Sabine Burgdorf.
Mathematical Programming | 2013
Sabine Burgdorf; Kristijan Cafuta; Igor Klep; Janez Povh
The main topic addressed in this paper is trace-optimization of polynomials in noncommuting (nc) variables: given an nc polynomial f, what is the smallest trace
Linear & Multilinear Algebra | 2011
Sabine Burgdorf
conference on theory of quantum computation communication and cryptography | 2015
Sabine Burgdorf; Monique Laurent; Teresa Piovesan
{f(\underline {A})}
Commentarii Mathematici Helvetici | 2012
Sabine Burgdorf; Claus Scheiderer; Markus Schweighofer
Archive | 2016
Sabine Burgdorf; Igor Klep; Janez Povh
can attain for a tuple of matrices
Computational Optimization and Applications | 2013
Sabine Burgdorf; Kristijan Cafuta; Igor Klep; Janez Povh
Electronic Journal of Linear Algebra | 2017
Sabine Burgdorf; Monique Laurent; Teresa Piovesan
{\underline {A}}
Archive | 2016
Sabine Burgdorf; Igor Klep; Janez Povh
Archive | 2016
Sabine Burgdorf; Igor Klep; Janez Povh
? A relaxation using semidefinite programming (SDP) based on sums of hermitian squares and commutators is proposed. While this relaxation is not always exact, it gives effectively computable bounds on the optima. To test for exactness, the solution of the dual SDP is investigated. If it satisfies a certain condition called flatness, then the relaxation is exact. In this case it is shown how to extract global trace-optimizers with a procedure based on two ingredients. The first is the solution to the truncated tracial moment problem, and the other crucial component is the numerical implementation of the Artin-Wedderburn theorem for matrix *-algebras due to Murota, Kanno, Kojima, Kojima, and Maehara. Trace-optimization of nc polynomials is a nontrivial extension of polynomial optimization in commuting variables on one side and eigenvalue optimization of nc polynomials on the other side—two topics with many applications, the most prominent being to linear systems engineering and quantum physics. The optimization problems discussed here facilitate new possibilities for applications, e.g. in operator algebras and statistical physics.
Archive | 2016
Sabine Burgdorf; Igor Klep; Janez Povh
Lieb and Seiringer stated in their reformulation of the Bessis–Moussa–Villani conjecture that all coefficients of the polynomial p(t) = tr((A +tr B) m ) are non-negative whenever A and B are any two positive semidefinite matrices of the same size. We will show that for all m∈ℕ the coefficient of t 4 in p(t) is non-negative, using a connection to sums of Hermitian squares of non-commutative polynomials which has been established by Klep and Schweighofer. This implies by a well-known result of Hillar that the coefficients of t k are non-negative for 0 ≤ k ≤ 4, and by symmetry as well for m ≥ k ≥ m − 4.