The following pages link to VSDP (Q16193):
Displaying 12 items.
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Modal occupation measures and LMI relaxations for nonlinear switched systems control (Q899277) (← links)
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system (Q1744121) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- A non-linear arithmetic procedure for control-command software verification (Q2324228) (← links)
- Efficient upper and lower bounds for global mixed-integer optimal control (Q2342951) (← links)
- Finding largest small polygons with gloptipoly (Q2392118) (← links)
- Verification methods: rigorous results using floating-point arithmetic (Q2890535) (← links)
- Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming (Q4632034) (← links)
- Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
