Lipschitz condition in minimum norm problems on bounded functions

DOI10.1016/0021-9045(85)90046-2zbMath0579.41016OpenAlexW2091382372MaRDI QIDQ1067133

Vasant A. Ubhaya

Publication date: 1985

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(85)90046-2

zbMATH Keywords

continuous selectionsgreatest convex minorantApproximation by convex functionsGeneralized isotone optimizationminimum norm problems on bounded functionsoptimal Lipschitzian selections

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by other special function classes (41A30) Nonlinear operators and their properties (47H99)

Related Items (11)

Quasi-convex optimization ⋮ Optimal Lipschitzian selection operator in quasi-convex optimization ⋮ An O(n) algorithm for least squares quasi-convex approximation ⋮ Lipschitzian selections in approximation from nonconvex sets of bounded functions ⋮ \(L_ p\) approximation by quasi-convex and convex functions ⋮ Lipschitzian selections in best approximation by continuous functions ⋮ Uniform approximation by quasi-convex and convex functions ⋮ Uniform approximation by classes of functions closed under translation and pointwise supremum ⋮ Uniform approximation by classes of functions closed under translation and pointwise supremum ⋮ An asymptotic result for the degree of approximation by monotone polynomials ⋮ \(L_ p\)-approximation from nonconvex subsets of special classes of functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Determination of Chebyshev approximations by nonlinear admissible subsets
• Linear time algorithms for convex and monotone approximation
• Quasi-convex optimization
• An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
• Uniform approximation with constraints
• Isotonic approximation in \(L_ s\).
• Isotone optimization. II
• Generalized isotone optimization with applications to starshaped functions
• Convex hull of a finite set of points in two dimensions
• Divide and conquer for linear expected time
• Complexity of approximation problems
• O(n) algorithms for discrete n-point approximation by quasi-convex functions
• Best \(L_ 1\)-approximation of bounded, approximately continuous functions on [0,1 by nondecreasing functions]
• An efficient algorithm for determining the convex hull of a finite planar set
• Convex hulls of finite sets of points in two and three dimensions
• Another Proof that Convex Functions are Locally Lipschitz
• Point Estimates of Ordinates of Concave Functions
• Finding the convex hull of a simple polygon

This page was built for publication: Lipschitz condition in minimum norm problems on bounded functions