Lipschitz condition in minimum norm problems on bounded functions (Q1067133): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0021-9045(85)90046-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091382372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide and conquer for linear expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hull of a finite set of points in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform approximation with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best \(L_ 1\)-approximation of bounded, approximately continuous functions on [0,1] by nondecreasing functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the convex hull of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point Estimates of Ordinates of Concave Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isotonic approximation in \(L_ s\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of finite sets of points in two and three dimensions / 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: Q5593890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of Chebyshev approximations by nonlinear admissible subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isotone optimization. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for discrete n-point convex approximation with applications to continuous case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized isotone optimization with applications to starshaped functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for convex and monotone approximation / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:40, 14 June 2024

scientific article
Language Label Description Also known as
English
Lipschitz condition in minimum norm problems on bounded functions
scientific article

    Statements

    Lipschitz condition in minimum norm problems on bounded functions (English)
    0 references
    0 references
    1985
    0 references
    This paper considers the problem of finding optimal Lipschitzian selections in minimum norm problems on bounded functions; it is conceptually similar to the well-known problem of finding continuous selections. Consider the Banach space B of bounded functions f on a set S with uniform norm \(\| \cdot \|\). For each f in B, let \(K_ f\), possibly dependent on f, be a closed convex subset of B. The minimum norm problem is to find an element in \(K_ f\) nearest to f. Let \(G_ f\) be the closed convex set of all elements in \(K_ f\) which are nearest to f. In general, \(G_ f\) is not singleton. The problem is to find an optimal Lipschitzian selection operator \(T: B\to B\) defined by the following three conditions. (i) For each f in B, T(f) is in \(G_ f\). (ii) T is Lipschitzian, i.e., \(\| T(f)-T(h)\| \leq C\| f-h\|\) for all f,h in B for some least number C. (iii) C is smallest among all Lipschitzian operators mapping f to an element in \(G_ f.\) Another problem considered is to find a smallest number D satisfying \(\| \Delta (f)-\Delta (h)\| \leq D\| f-h\|\) for all f,h in B, where \(\Delta (f)=\| f-T(f)\|\) is the shortest distance from f to \(K_ f\). Three cases are considered. Case 1: The greatest convex minorant (gcm). \(S=I=[a,b]\), a real interval. \(K_ f=\{k\) in B: k convex, \(k\leq f\}\). \(\bar f(\)s)\(=\sup \{k(s):\) k in \(K_ f\}\), s in S, is the gcm of f. Then \(T(f)=\bar f\), \(C=1\), \(D=2\). Case 2: Approximation by convex functions. \(S=I\) as above, \(K_ f=K=\{k\) in B: k convex on \(I\}\). Then \(\Delta (f)=(1/2)\| f-\bar f\|\). If \(f'=\bar f+\Delta (f)\) then f' is in \(G_ f\). Then \(T(f)=f'\), \(C=2\), \(D=1\). Case 3: Generalized isotone optimization. S is a partially ordered set and \(K_ f=K\) is the set of all functions in B which satisfy certain isotonicity and nonnegativity conditions on subsets of S. In this case there exist two nearest functions \(f_*\) and \(f^*\), respectively, the minimal and the maximal with \(f_*\leq f^*\). Then \(T(f)=(1/2)(f_*+f^*),\) \(C=1\).
    0 references
    optimal Lipschitzian selections
    0 references
    minimum norm problems on bounded functions
    0 references
    continuous selections
    0 references
    greatest convex minorant
    0 references
    Approximation by convex functions
    0 references
    Generalized isotone optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references