Generic well-posedness in minimization problems

Abstract

The goal of this paper is to provide an overview of results concerning, roughly speaking, the following issue: given a (topologized) class of minimum problems, “how many” of them are well-posed? We will consider several ways to define the concept of “how many,” and also several types of well-posedness concepts. We will concentrate our attention on results related to uniform convergence on bounded sets, or similar convergence notions, as far as the topology on the class of functions under investigation is concerned.