A Sublevel Moment-SOS Hierarchy for Polynomial Optimization
arXiv:2101.05167
Abstract
We introduce a sublevel Moment-SOS hierarchy where each SDP relaxation can be viewed as an intermediate (or interpolation) between the d-th and (d+1)-th order SDP relaxations of the Moment-SOS hierarchy (dense or sparse version). With the flexible choice of determining the size (level) and number (depth) of subsets in the SDP relaxation, one is able to obtain different improvements compared to the d-th order relaxation, based on the machine memory capacity. In particular, we provide numerical experiments for d=1 and various types of problems both in combinatorial optimization (Max-Cut, Mixed Integer Programming) and deep learning (robustness certification, Lipschitz constant of neural networks), where the standard Lasserre's relaxation (or its sparse variant) is computationally intractable. In our numerical results, the lower bounds from the sublevel relaxations improve the bound from Shor's relaxation (first order Lasserre's relaxation) and are significantly closer to the optimal value or to the best-known lower/upper bounds.
arXiv comment25 pages, 13 tables
References in corpus (7)
- Semidefinite relaxations for certifying robustness to adversarial examples
- Quantum Bounds on Bell inequalities
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Solving condensed-matter ground-state problems by semidefinite relaxations
- Approximating regions of attraction of a sparse polynomial differential system *
- Variational-Correlations Approach to Quantum Many-body Problems
- SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions