In this chapter we introduce the class of Online Convex Optimization (OCO) problems and derive Online Gradient Descent (OGD) as a suitable learning algorithm for such cases.
