Cited in
(14)- Modal occupation measures and LMI relaxations for nonlinear switched systems control
- On verified numerical computations in convex programming
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- A non-linear arithmetic procedure for control-command software verification
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- FIR toolbox
- CalCS
- Finding largest small polygons with gloptipoly
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming
- Verification methods: rigorous results using floating-point arithmetic
- Efficient upper and lower bounds for global mixed-integer optimal control
- Validating numerical semidefinite programming solvers for polynomial invariants
This page was built for software: VSDP
