This text explains developments of infinite dimensional convex programming in the context of convex analysis, including duality; minmax and Lagrangians; and convexification of optimization problems in calculus of variations. It also covers convex duality applied to partial differential equations.