TSSOS: a Julia library to exploit sparsity for large-scale polynomial optimization
classification
🧮 math.OC
cs.MS
keywords
tssosinvolvingjulialarge-scalelibraryoptimizationpolynomialproblems
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Composition and tensor train structure in polynomial optimization
Two new state-lifting moment-SOS hierarchies exploit composition and tensor train structure to compute certified bounds for large polynomial optimization problems.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.