In this paper we study the convergence of the infima and of (approximate) solutions of a sequence of minimization problems. It is shown that the main assumptions needed in order to guarantee the requested convergence properties are those of the consistency and the a-regularity of the underlying functionals, conceptions which are well-known from the discretization theory of differential equations. This paper is continued by a second part in which the theoretical results are applied to a number of concrete problems.