A geometric algorithm for approximating semicontinuous function
From MaRDI portal
Let h be an upper semicontinuous function on a metric space X, and let f be a continuous function that majorizes h. For each x in X let \(\phi\) (f,h)(x) be the distance of (x,f(x)) to the graph of h. In this article we study the following algorithm that produces a decreasing sequence of continuous functions convergent pointwise to h: set \(f_ 0=f\), and for each positive integer k, let \(f_ k=f_{k-1}-\phi (f_{k-1},h).\)
Recommendations
- scientific article; zbMATH DE number 3962377
- Characterizations of certain classes of semicontinuous multifunctions by continuous approximations
- scientific article; zbMATH DE number 4122255
- A criterion for the approximation of a semicontinuous functional by Lipschitz functionals
- scientific article; zbMATH DE number 695434
Cites work
- Characterizing the 3-cell by its metric
- Continuous selections. I
- Hausdorffsche Metrik und Approximationen
- scientific article; zbMATH DE number 3710731 (Why is no real title available?)
- scientific article; zbMATH DE number 3498870 (Why is no real title available?)
- scientific article; zbMATH DE number 5021939 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- scientific article; zbMATH DE number 3374308 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- Some characterizations of normal and perfectly normal spaces
Cited in
(2)
This page was built for publication: A geometric algorithm for approximating semicontinuous function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086758)