Uncertainty quantification for subgradient descent, with applications to relaxations of discrete problems

Conor McMeel, Panos Parpas

We consider the problem of minimizing a convex function that depends on an uncertain parameter $\theta$. The uncertainty in the objective function means that the optimum, $x^{\ast }(\theta )$, is a…