Cited in
(7)- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Sum-of-squares optimization without semidefinite programming
- SOSOPT
- GpoSolver
- Sparse-BSOS
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- A Lagrange multiplier expression method for bilevel polynomial optimization
This page was built for software: SPOT
