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