Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Let Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal propert...
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Given a set P of n points on the real line and a (potentially innite) family of functions, we investigate the problem of nding a small (weighted) subset S P, such that for any f ...