TSSOS: a Julia library to exploit sparsity for large-scale polynomial optimization
arXiv:2103.00915
Abstract
The Julia library TSSOS aims at helping polynomial optimizers to solve large-scale problems with sparse input data. The underlying algorithmic framework is based on exploiting correlative and term sparsity to obtain a new moment-SOS hierarchy involving potentially much smaller positive semidefinite matrices. TSSOS can be applied to numerous problems ranging from power networks to eigenvalue and trace optimization of noncommutative polynomials, involving up to tens of thousands of variables and constraints.
arXiv comment10 pages, 2 figures, 2 tables
References in corpus (6)
- The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithms
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Semialgebraic Optimization for Lipschitz Constants of ReLU Networks
- Fairness in Forecasting and Learning Linear Dynamical Systems
- SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions
- A Sublevel Moment-SOS Hierarchy for Polynomial Optimization