Quadratic Optimization over Probability Measures with Coupling Constraints
This work considers solving an optimization instance in which the objective is quadratic and where the decision variable is a probability measure, and proposes a hierarchy of convex relaxations based on searching over probability measures over products of the base space that converges to the globally optimal solution.