Fetching the paper…
Reading the bibliography…
The Julia library TSSOS aims at helping polynomial optimizers to solve large-scale problems with sparse input data.
Sdpt3—a matlab software package for semidefinite programming, version 1.3
Kim-Chuan Toh, Michael J Todd, and Reha H Tütüncü · 1999
Earlier work this paper cites.
Global Optimization with Polynomials and the Problem of Moments
J.-B. Lasserre · 2001
Earlier work this paper cites.
Convergent sdp-relaxations in polynomial optimization with sparsity
J.-B. Lasserre · 2006
Earlier work this paper cites.
Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity
H. Waki, S. Kim, M. Kojima, and M. Muramatsu · 2006
Earlier work this paper cites.
Algorithm 883: Sparsepop—a sparse semidefinite programming relaxation of polynomial optimization problems
Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu, and Hiroshi Sugimoto · 2008
Earlier work this paper cites.
Treewidth computations i. upper bounds
Hans L Bodlaender and Arie MCA Koster · 2010
Earlier work this paper cites.
The MOSEK optimization toolbox. Version 8.1
MOSEK ApS · 2017
Earlier work this paper cites.
Juliagraphs/lightgraphs.jl: an optimized graphs package for the julia programming language, 2017
Seth Bromberger, James Fairbanks, and other contributors · 2017
Earlier work this paper cites.
Jump: A modeling language for mathematical optimization
Iain Dunning, Joey Huchette, and Miles Lubin · 2017
Earlier work this paper cites.
Certified roundoff error bounds using semidefinite programming
Victor Magron, George Constantinides, and Alastair Donaldson · 2017
Earlier work this paper cites.
Lasserre hierarchy for large scale polynomial optimization in real and complex variables
Cédric Josz and Daniel K Molzahn · 2018
Cited alongside, same era.
Interval enclosures of upper bounds of roundoff errors using semidefinite programming
Victor Magron · 2018
Cited alongside, same era.
The power grid library for benchmarking ac optimal power flow algorithms
Sogol Babaeinejadsarookolaee, Adam Birchfield, Richard D Christie, Carleton Coffrin, Christopher DeMarco, Ruisheng Diao, Michael Ferris, Stephane Fliscounakis, Scott Greene, Renke Huang, et al · 2019
Cited alongside, same era.
Cosmo: A conic operator splitting method for large convex problems
Michael Garstka, Mark Cannon, and Paul Goulart · 2019
Cited alongside, same era.
Exploiting sparsity for semi-algebraic set volume computation
Matteo Tacchi, Tillmann Weisser, Jean-Bernard Lasserre, and Didier Henrion · 2019
SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions
Jie Wang, Martina Maggio, and Victor Magron · 2020
Later among the works it cites.
Exploiting term sparsity in noncommutative polynomial optimization
Jie Wang and Victor Magron · 2020
Later among the works it cites.
Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
Jie Wang, Victor Magron, and Jean-Bernard Lasserre · 2020
Later among the works it cites.
TSSOS: A Moment-SOS hierarchy that exploits term sparsity
Jie Wang, Victor Magron, and Jean-Bernard Lasserre · 2020
Later among the works it cites.
CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization
Jie Wang, Victor Magron, Jean-Bernard Lasserre, and Ngoc Hoang Anh Mai · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Semialgebraic optimization for lipschitz constants of relu networks
Tong Chen, Jean-Bernard Lasserre, Victor Magron, and Edouard Pauwels · 2020
Cited alongside, same era.
Exploiting constant trace property in large-scale polynomial optimization
Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron, and Jie Wang · 2020
Cited alongside, same era.
A sparse version of reznick’s positivstellensatz
Ngoc Hoang Anh Mai, Victor Magron, and J-B Lasserre · 2020
Cited alongside, same era.
Sparse moment-sum-of-squares relaxations for nonlinear dynamical systems with guaranteed convergence
Corbinian Schlosser and Milan Korda · 2020
Cited alongside, same era.
ChordalGraph: A Julia Package to Handle Chordal Graphs
Jie Wang · 2020
Cited alongside, same era.
Later among the works it cites.
Proper learning of linear dynamical systems as a non-commutative polynomial optimisation problem
Quan Zhou and Jakub Marecek · 2020
Later among the works it cites.
Fairness in forecasting and learning linear dynamical systems
Quan Zhou, Jakub Marecek, and Robert N Shorten · 2020
Later among the works it cites.
A sublevel moment-sos hierarchy for polynomial optimization
Tong Chen, Jean-Bernard Lasserre, Victor Magron, and Edouard Pauwels · 2021
Closest in time.
Sparse noncommutative polynomial optimization
Igor Klep, Victor Magron, and Janez Povh · 2021
Closest in time.
The constant trace property in noncommutative optimization
Ngoc Hoang Anh Mai, Abhishek Bhardwaj, and Victor Magron · 2021
Closest in time.