An O(n) algorithm for discrete n-point convex approximation with applications to continuous case

DOI10.1016/0022-247X(79)90293-2zbMath0419.65008OpenAlexW1982244470MaRDI QIDQ1132491

Vasant A. Ubhaya

Publication date: 1979

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(79)90293-2

zbMATH Keywords

algorithmlinear programminggreatest convex minorantbest convex approximationbest monotone approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Related Items (12)

Quasi-convex optimization ⋮ Optimal Lipschitzian selection operator in quasi-convex optimization ⋮ An O(n) algorithm for least squares quasi-convex approximation ⋮ Uniform approximation by quasi-convex and convex functions ⋮ A duality approach to best uniform convex approximation ⋮ O(n) algorithms for discrete n-point approximation by quasi-convex functions ⋮ Generalized isotone optimization with applications to starshaped functions ⋮ Nonlinear programming, approximation, and optimization on infinitely differentiable functions ⋮ \(L_ p\)-approximation from nonconvex subsets of special classes of functions ⋮ Linear time algorithms for convex and monotone approximation ⋮ Lipschitz condition in minimum norm problems on bounded functions ⋮ Best piecewise monotone uniform approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isotone optimization. II
• Duality in approximation and conjugate cones in normed linear spaces
• Generalized isotone optimization with applications to starshaped functions
• Divide and conquer for linear expected time
• An efficient algorithm for determining the convex hull of a finite planar set
• On the identification of the convex hull of a finite set of points in the plane
• Moduli of Monotonicity with Applications to Monotone Polynomial Approximation
• Convex hulls of finite sets of points in two and three dimensions
• Another Proof that Convex Functions are Locally Lipschitz
• Applications of Linear Programming to Numerical Analysis
• Point Estimates of Ordinates of Concave Functions

This page was built for publication: An O(n) algorithm for discrete n-point convex approximation with applications to continuous case