Maximizing products of linear forms, and the permanent of positive semidefinite matrices

Abstract We study the convex relaxation of a polynomial optimization problem, maximizing a product of linear forms over the complex sphere. We show that this convex program is also a relaxation of the permanent of Hermitian positive semidefinite (HPSD) matrices. By analyzing a constructive randomize...

Full description

Bibliographic Details
Main Authors: Yuan, Chenyang (Author), Parrilo, Pablo A. (Author)
Format: Article
Language:English
Published: Springer Berlin Heidelberg, 2022-04-26T11:55:08Z.
Subjects:
Online Access:Get fulltext
LEADER 01101 am a22001453u 4500
001 142071
042 |a dc 
100 1 0 |a Yuan, Chenyang  |e author 
700 1 0 |a Parrilo, Pablo A.  |e author 
245 0 0 |a Maximizing products of linear forms, and the permanent of positive semidefinite matrices 
260 |b Springer Berlin Heidelberg,   |c 2022-04-26T11:55:08Z. 
856 |z Get fulltext  |u https://hdl.handle.net/1721.1/142071 
520 |a Abstract We study the convex relaxation of a polynomial optimization problem, maximizing a product of linear forms over the complex sphere. We show that this convex program is also a relaxation of the permanent of Hermitian positive semidefinite (HPSD) matrices. By analyzing a constructive randomized rounding algorithm, we obtain an improved multiplicative approximation factor to the permanent of HPSD matrices, as well as computationally efficient certificates for this approximation. We also propose an analog of van der Waerden's conjecture for HPSD matrices, where the polynomial optimization problem is interpreted as a relaxation of the permanent. 
546 |a en 
655 7 |a Article