Cited in
(27)- A unified framework of SAGE and SONC polynomials and its duality theory
- Convergent upper bounds of peak response of LTI and polytopic LTV systems through LMIs
- A multilevel analysis of the Lasserre hierarchy
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- Sum-of-squares optimization without semidefinite programming
- GloptiPoly
- Padua2D
- SparsePOP
- SOSOPT
- GpoSolver
- SPOT
- SPOTless
- BBCPOP
- StdPooling-PolyAlgos
- TSSOS
- SparseJSR
- Misspecified nonconvex statistical optimization for sparse phase retrieval
- A sublevel moment-SOS hierarchy for polynomial optimization
- REPOP
- Sparse noncommutative polynomial optimization
- A new approximation hierarchy for polynomial conic optimization
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy
- Finding unstable periodic orbits: a hybrid approach with polynomial optimization
This page was built for software: Sparse-BSOS
