Best quasi-convex uniform approximation (Q805957): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3962403 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Another Proof that Convex Functions are Locally Lipschitz / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the characterization and computation of best monotone approximation in \(L_ p[0,1]\) for \(1\leq p<\infty\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3349386 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Isotone optimization. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Isotone optimization. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: O(n) algorithms for discrete n-point approximation by quasi-convex functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasi-convex optimization / rank | |||
Normal rank |
Latest revision as of 17:41, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Best quasi-convex uniform approximation |
scientific article |
Statements
Best quasi-convex uniform approximation (English)
0 references
1990
0 references
Let B be the linear space of all bounded real functions f on [0,1] with the norm \(\| f\|_{\infty}=\sup_{x\in [0,1]}| f(x)|.\) The function \(g\in B\) is quasi-convex if g(x)\(\leq \max \{g(s),g(t)\}\) for all \(0\leq s\leq x\leq t\leq 1\). Let \(K\subset B\) denote the set of all quasi-convex functions on [0,1]. \textit{V. A. Ubhaya} [J. Math. Anal. Appl. 116, 439-449 (1986; Zbl 0595.90099)] proved that \(g\in B\) is quasi-convex if and only if there exists a point \(p\in [0,1]\) such that either ``g is nonincreasing on [0,p) and is nondecreasing on [p,1]'' or the same holds on [0,p] and (p,1], respectively. In both cases it is said that the point p is a knot of g. For \(f\in C[0,1]\) let \[ G(f)=\{g^*\in K:\;\| f- g^*\|_{\infty}=\inf_{g\in K}\{\| f-g\| \}\} \] be the set of best quasi-convex approximations to f and let \(p^*=\{p\in [0,1]:\) p is a knot for some \(g^*\in G\}\) be the set of optimal knots of f. The authors characterize both the best quasi-convex approximations and the optimal knots.
0 references
best quasi-convex approximations
0 references
optimal knots
0 references
0 references