Lipschitzian selections in approximation from nonconvex sets of bounded functions (Q1120769): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0021-9045(89)90111-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079792408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of metric selections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3226265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximation problems / 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: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitz condition in minimum norm problems on bounded functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform approximation by quasi-convex and convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitzian selections in best approximation by continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700217 / rank
 
Normal rank

Latest revision as of 14:26, 19 June 2024

scientific article
Language Label Description Also known as
English
Lipschitzian selections in approximation from nonconvex sets of bounded functions
scientific article

    Statements

    Lipschitzian selections in approximation from nonconvex sets of bounded functions (English)
    0 references
    0 references
    1989
    0 references
    Let X be the space of bounded functions on a set S, endowed with uniform norm. In this paper the following problem is studied: given a (not necessarily convex) set K, find conditions on K which assure the existence of a Lipschitzian selection operator for the best approximation. Some results are stated, by using the following conditions on K: (i) if \(k\in K\) and \(c\in R\), then \(k+c\in K\); (ii) the pointwise supremum [resp.: infimum] of a set of functions on K, uniformly bounded above [resp.: below] is in K. The author indicates that other results of this kind are contained in a forthcoming paper by himself, to appear in J. Approximation Theory.
    0 references
    Lipschitzian selection operator
    0 references
    best approximation
    0 references

    Identifiers