ON ALMOST WELL-POSED MUTUALLY NEAREST AND MUTUALLY FURTHEST POINT PROBLEMS (Q3148353)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1810516
Language Label Description Also known as
default for all languages
No label defined
    English
    ON ALMOST WELL-POSED MUTUALLY NEAREST AND MUTUALLY FURTHEST POINT PROBLEMS
    scientific article; zbMATH DE number 1810516

      Statements

      ON ALMOST WELL-POSED MUTUALLY NEAREST AND MUTUALLY FURTHEST POINT PROBLEMS (English)
      0 references
      0 references
      0 references
      17 March 2003
      0 references
      minimization problem
      0 references
      maximization problem
      0 references
      minimizing sequence
      0 references
      maximizing sequences
      0 references
      well-posed
      0 references
      strongly convex space
      0 references
      Kadec space
      0 references
      Let \(X\) be a real Banach space and \({\mathcal B}(X)\) denote the space of all non-empty closed bounded subsets of \(X\) endowed with the Hausdorff distance. For a closed subset \(G\) of \(X\) and \(A\in{\mathcal B}(X)\), set \(\lambda_{AG}= \inf\{\|x-z\|: x\in A\), \(z\in G\}\) and if \(G\) is also bounded, set \(H_{AG}= \sup\|x-z\|: x\in A\), \(z\in G\}\). We say that a pair \((x_0, z_0)\) with \(x_0\in A\), \(z_0\in G\) is a solution of the minimization (resp. maximization) problem, denoted by \(\min(A,G)\) (resp. \(\max(A,G)\)), if \(\|x_0- z_0\|= \lambda_{AG}\) (resp. \(\|x_0- z_0\|= H_{AG}\)). Any sequence \(\{(x_n, z_n)\}\) with \(x_n\in A\) and \(z_n\in G\) for all \(n\) such that \(\lim_{n\to\infty}\|x_n- z_n\|= \lambda_{AG}\) (resp. \(\lim_{n\to\infty}\|x_n- z_n\|= H_{AG}\)) is called a minimizing (resp. maximizing) sequence for \(\min(A,G)\) (resp. \(\max(A,G)\)). A minimization (resp. maximization) problem \(\min(A,G)\) (resp. \(\max(A, G)\)) is said to be well-posed if it has a unique solution \((x_0, z_0)\) and every minimizing (resp. maximizing) sequence converges strongly to \((x_0, z_0)\). A Banach space \(X\) is said to be Kadec provided for each sequence \(\{x_n\}\subset X\) which converges weakly to \(x\) with \(\lim_{n\to\infty}\|x_n\|= \|x\|\) we have \(\lim_{n\to\infty}\|x_n- x\|= 0\). A Banach space \(X\) is said to be strongly convex if it is reflexive, Kadec and strictly convex. If \({\mathcal B}_G(X)\) denotes the closure of the set \(\{A\in{\mathcal B}(X): A\cap G=\emptyset\}\), the authors prove that \(E^0(G)\) (resp. \(E_0(G)\)), the set of all \(A\in{\mathcal B}_G(X)\) (resp. \(A\in{\mathcal B}(X)\)) such that the minimization (resp. maximization) problem \(\min(A,G)\) (resp. \(m(A,G)\)) is well posed, is residual in \({\mathcal B}_G(X)\) (resp. \({\mathcal B}(X)\)).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references