An algorithm with a static regret of $O(\sqrt{T})$ and a CCV of $\min\{{\cal V}, O(\sqrt{T}\log T) \}$, for constrained online convex optimization where ${\cal V}$ depends on the geometric properties of the instance .