On sums and convex combinations of projectors onto convex sets (Q1740660)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    On sums and convex combinations of projectors onto convex sets
    scientific article

      Statements

      On sums and convex combinations of projectors onto convex sets (English)
      0 references
      0 references
      0 references
      0 references
      2 May 2019
      0 references
      In this paper, the authors completely characterize the cases where the projector onto the Minkowski sum of closed convex sets is equal to the sum of individual projectors, which is not true in general. The case of linear subspaces was known, whereas this question was solved by \textit{E. H. Zarantonello} for convex cones in [in: Contrib. Nonlin. Funct. Anal., Proc. Sympos. Univ. Wisconsin, Madison, 237--424 (1971; Zbl 0281.47043)]. Therefore, these new results unify the known cases and completely solve the problem for arbitrary closed convex sets. The authors also establish the partial sum property for projectors onto convex cones.
      0 references
      convex set
      0 references
      convex cone
      0 references
      convex combination
      0 references
      projection operator
      0 references
      sum of projectors
      0 references
      partial sum property
      0 references
      monotone operator
      0 references
      proximity operator
      0 references

      Identifiers

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