Linear time algorithms for convex and monotone approximation

DOI10.1016/0898-1221(83)90121-9zbMath0536.65012OpenAlexW2041308267MaRDI QIDQ792060

Vasant A. Ubhaya

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0898-1221(83)90121-9

zbMATH Keywords

optimal solutionsmonotone approximationComputational resultsconvex approximation

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
• Isotone optimization. II
• 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
• Convex hulls of finite sets of points in two and three dimensions

This page was built for publication: Linear time algorithms for convex and monotone approximation