Moment/Sum-of-Squares Hierarchy for Complex Polynomial Optimization
Preprint
Abstract
We consider the problem of finding the global optimum of a real-valued complex polynomial on a compact set defined by real-valued complex polynomial inequalities. It reduces to solving a sequence of complex semidefinite programming relaxations that grow tighter and tighter thanks to D'Angelo's and Putinar's Positivstellenstatz discovered in 2008. In other words, the Lasserre hierarchy may be transposed to complex numbers. We propose a method for exploiting sparsity and apply the complex hierarchy to problems with several thousand complex variables. These problems consist of computing optimal power flows in the European high-voltage transmission network.Keywords
All Related Versions
This publication has 48 references indexed in Scilit:
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronizationMathematical Programming, 2016
- Strong duality in Lasserre’s hierarchy for polynomial optimizationOptimization Letters, 2015
- Angular synchronization by eigenvectors and semidefinite programmingApplied and Computational Harmonic Analysis, 2011
- The geometric measure of multipartite entanglement and the singular values of a hypermatrixJournal of Mathematical Physics, 2010
- Semidefinite programming for optimal power flow problemsInternational Journal of Electrical Power & Energy Systems, 2008
- A note on the representation of positive polynomials with structured sparsityArchiv der Mathematik, 2007
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- Positive definite completions of partial Hermitian matricesLinear Algebra and its Applications, 1984
- On the representation of hermitian forms as sums of squaresInventiones Mathematicae, 1968
- Zur formalen Theorie der Funktionen von mehr komplexen Ver nderlichenMathematische Annalen, 1927