A Fine-Grained Variant of the Hierarchy of Lasserre
arXiv:1906.09586
Abstract
There has been much recent interest in hierarchies of progressively stronger convexifications of polynomial optimisation problems (POP). These often converge to the global optimum of the POP, asymptotically, but prove challenging to solve beyond the first level in the hierarchy for modest instances. We present a finer-grained variant of the Lasserre hierarchy, together with first-order methods for solving the convexifications, which allow for efficient warm-starting with solutions from lower levels in the hierarchy.
References in corpus (5)
- Optimal Power Flow as a Polynomial Optimization Problem
- Algorithm 950: Ncpol2sdpa---Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables
- Optimization over Nonnegative and Convex Polynomials With and Without Semidefinite Programming
- A Low-Rank Coordinate-Descent Algorithm for Semidefinite Programming Relaxations of Optimal Power Flow
- MINLP in Transmission Expansion Planning