CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
From MaRDI portal
Publication:6599983
DOI10.1145/3569709MaRDI QIDQ6599983
Ngoc Hoang Anh Mai, Victor Magron, Jean B. Lasserre, Jie Wang
Publication date: 6 September 2024
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Lasserre's hierarchyoptimal power flowcorrelative sparsitymoment-SOS hierarchyterm sparsitylarge-scale polynomial optimizationTSSOS
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Optimality conditions and finite convergence of Lasserre's hierarchy
- On the robustness and scalability of semidefinite relaxation for optimal power flow problems
- Positive definite completions of partial Hermitian matrices
- Positive semidefinite matrices with a given sparsity pattern
- Extremal psd forms with few terms
- Algorithmic graph theory and perfect graphs
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- On the complexity of Putinar-Vasilescu's Positivstellensatz
- Exploiting term sparsity in noncommutative polynomial optimization
- Incidence matrices and interval graphs
- Anneaux preordonnes
- A bounded degree SOS hierarchy for polynomial optimization
- A note on the representation of positive polynomials with structured sparsity
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Exploiting sparsity for semi-algebraic set volume computation
- Global optimization with polynomials and the problem of moments
- Relative entropy relaxations for signomial optimization
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Certified Roundoff Error Bounds Using Semidefinite Programming
- Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Scalable Semidefinite Programming
- A New Sparse SOS Decomposition Algorithm Based on Term Sparsity
- A second order cone characterization for sums of nonnegative circuits
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite 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
- Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Handbook of semidefinite programming. Theory, algorithms, and applications
Related Items (7)
Global minimization of polynomial integral functionals ⋮ A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients ⋮ Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets ⋮ Lower bounds of functions on finite abelian groups ⋮ The moment-SOS hierarchy: applications and related topics ⋮ Trajectory generation for the unicycle model using semidefinite relaxations ⋮ Peak estimation of rational systems using convex optimization
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)
