A geometric algorithm for approximating semicontinuous function (Q1086758)

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).\)