On stability of minimizers in convex programming

In this paper, we establish conditions ensuring Hölder and Lipschitz continuity of minimizers in convex programming. Lipschitz continuity is proved by establishing and applying a generalized version of the implicit function theorem.