Refined TSSOS
From MaRDI portal
Cites work
- A bounded degree SOS hierarchy for polynomial optimization
- A new sparse SOS decomposition algorithm based on term sparsity
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- An introduction to polynomial and semi-algebraic optimization
- Anneaux preordonnes
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Exploiting sparsity in complex polynomial optimization
- Extremal psd forms with few terms
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 753805 (Why is no real title available?)
- JuMP: a modeling language for mathematical optimization
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
This page was built for publication: Refined TSSOS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967877)