activity
20142019
most citedDistributionally robust polynomial chance-constraints under mixture ambiguity sets

17 citations · 26 across the 6 of their papers we have counts for

collaborators
Showing 2016 · math.OCShow all

1 paper · 2 filters

math.OC2016

Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity

Tillmann Weisser, Jean-Bernard Lasserre, Kim-Chuan Toh

We provide a sparse version of the bounded degree SOS hierarchy BSOS [7] for polynomial optimization problems. It permits to treat large scale problems which satisfy a structured s…