“Positive” noncommutative polynomials are sums of squares
暂无分享,去创建一个
[1] V. Paulsen. Completely bounded maps and dilations , 1987 .
[2] L. Rodman,et al. Positive semidefinite matrices with a given sparsity pattern , 1988 .
[3] Olga Taussky-Todd. SOME CONCRETE ASPECTS OF HILBERT'S 17TH PROBLEM , 1996 .
[4] V. Powers,et al. An algorithm for sums of squares of real polynomials , 1998 .
[5] P. Parrilo. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .
[6] Robert E. Skelton,et al. A symbolic algorithm for determining convexity of a matrix function: how to get Schur complements out of your life , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).
[7] Scott McCullough. Factorization of operator-valued polynomials in several non-commuting variables☆ , 2001 .
[8] K. Roberts,et al. Thesis , 2002 .