A geometric algorithm for approximating semicontinuous function (Q1086758): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0021-9045(87)90111-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060392540 / rank | |||
Normal rank | |||
Revision as of 18:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A geometric algorithm for approximating semicontinuous function |
scientific article |
Statements
A geometric algorithm for approximating semicontinuous function (English)
0 references
1987
0 references
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).\)
0 references
distance function
0 references
upper semicontinuous function
0 references
algorithm
0 references
