Online convex programming and generalized infinitesimal gradient ascent
Convex programming involves a convex set F ⊆ R n and a convex function c: F → R. The goal of convex programming is to find a point in F which minimizes c. In this paper, we intr...