We consider robust optimization for polynomial optimization problems where the uncertainty set is a set of candidate probability density functions. This set is a ball around a density function estimated from data samples, i.e., it is data-driven and random. Polynomial optimization problems are inherently hard due to noncon-vex objectives and constraints.… (More)
A mio padre, perchè prosegua. A Eliza, bo Dudu jestes. To Bill, mathematical samurai. As I understand it, there is no reality more independent of our perception and more true to itself than mathematical reality.