O(n) algorithms for discrete n-point approximation by quasi-convex functions

DOI10.1016/0898-1221(84)90064-6zbMath0559.65007OpenAlexW2058339068MaRDI QIDQ2266345

Vasant A. Ubhaya

Publication date: 1984

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(84)90064-6

zbMATH Keywords

optimal solutionslinear time algorithmsdiscrete n-point approximation by quasi-convex functions

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Approximation by other special function classes (41A30)

Related Items (8)

Quasi-convex optimization ⋮ An O(n) algorithm for least squares quasi-convex approximation ⋮ Uniform approximation by classes of functions closed under translation and pointwise supremum ⋮ An \(O(n)\) algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions ⋮ Uniform approximation by classes of functions closed under translation and pointwise supremum ⋮ Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance ⋮ Best quasi-convex uniform approximation ⋮ Lipschitz condition in minimum norm problems on bounded functions

Cites Work

• Linear time algorithms for convex and monotone approximation
• An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
• Isotone optimization. II
• Divide and conquer for linear expected time
• 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
• Seven Kinds of Convexity
• A Review of Quasi-Convex Functions

This page was built for publication: O(n) algorithms for discrete n-point approximation by quasi-convex functions