no code implementations • NeurIPS 2013 • Martin Mevissen, Emanuele Ragnoli, Jia Yuan Yu
We consider robust optimization for polynomial optimization problems where the uncertainty set is a set of candidate probability density functions.
