Introduction to Online Convex Optimization VII: The Online Conditional Gradient AlgorithmTextbook
Every algorithm through Chapter VI updates its iterate by a Euclidean projection onto the decision set . For many decision sets that arise in practice — bounded-nuclear-norm matrices (matrix completion / recommendation systems), the flow polytope (network routing), the Birkhoff–von Neumann polytope (ranking/permutations), matroid polytopes — a projection…