CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization

Cites Work

Detecting Global Optimality and Extracting Solutions in GloptiPoly
Title not available (Why is that?)
Global optimization with polynomials and the problem of moments
Algorithmic graph theory and perfect graphs
Incidence matrices and interval graphs
A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
Title not available (Why is that?)
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
Handbook of semidefinite programming. Theory, algorithms, and applications
Amoebas, nonnegative polynomials and sums of squares supported on circuits
DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
Positive definite completions of partial Hermitian matrices
Anneaux preordonnes
Optimality conditions and finite convergence of Lasserre's hierarchy
Positive semidefinite matrices with a given sparsity pattern
An introduction to polynomial and semi-algebraic optimization
Title not available (Why is that?)
Relative entropy relaxations for signomial optimization
Extremal psd forms with few terms
A note on the representation of positive polynomials with structured sparsity
Lasserre hierarchy for large scale polynomial optimization in real and complex variables
A bounded degree SOS hierarchy for polynomial optimization
On the robustness and scalability of semidefinite relaxation for optimal power flow problems
Certified roundoff error bounds using semidefinite programming
Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization
Exploiting term sparsity in noncommutative polynomial optimization
Exploiting sparsity for semi-algebraic set volume computation
Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
Decomposed structured subsets for semidefinite and sum-of-squares optimization
Scalable semidefinite programming
On the complexity of Putinar-Vasilescu's Positivstellensatz
A second order cone characterization for sums of nonnegative circuits
A new sparse SOS decomposition algorithm based on term sparsity

Cited In (7)

Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
Global minimization of polynomial integral functionals
Lower bounds of functions on finite abelian groups
The moment-SOS hierarchy: applications and related topics
Peak estimation of rational systems using convex optimization
Trajectory generation for the unicycle model using semidefinite relaxations
A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients

This page was built for publication: CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599983)