scientific article; zbMATH DE number 2127850
The authors survey well-posedness and stability of some minimization problems, most often without proofs. One of the problems considered is the generic well-posedness of best approximants. For a normed linear space \(X\) and a non-empty closed set \(V \subset X\) and for \(x \in X\), \(v \in V\), let \(I_x(v) = \| x -v\| \). The problem of finding a best approximant \(v_0\) to \(x\) in \(V\) is denoted by \((V,I_x)\). Suppose now \(X\) is reflexive and has the Kadec property. Then a theorem of \textit{K.-S. Lau} [Indiana Univ. Math. J. 27, 791--795 (1978; Zbl 0398.41026)] can be reformulated as `\(\{x \in X \setminus V : \text{ the problem }(V,I_x)\text{ is generalized well-posed}\}\) is generic in \(X\setminus V\)', i.e.,it contains a dense \(G_{\delta}\) subset of \(X\). For the entire collection see [Zbl 1047.41001].
- Well-posedness of approximation and optimization problems for weakly convex sets and functions
- scientific article; zbMATH DE number 3869928 (Why is no real title available?)
- scientific article; zbMATH DE number 2059866 (Why is no real title available?)
- On well-posedness of some problems in approximation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154841)
