An algorithm for discrete approximation by quasi-convex functions on \(R^m\)

DOI10.1016/j.camwa.2004.06.023zbMath1077.65013OpenAlexW2059728435MaRDI QIDQ1767886

Vasant A. Ubhaya

Publication date: 8 March 2005

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

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.06.023

zbMATH Keywords

computational complexitybest approximationdiscrete approximationquasi-convex function

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Algorithms for approximation of functions (65D15)

Related Items (2)

Best approximation by integer-valued functions ⋮ An \(O(n)\) algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal real-time algorithm for planar convex hulls
• Integer Isotone Optimization
• Another Proof that Convex Functions are Locally Lipschitz

This page was built for publication: An algorithm for discrete approximation by quasi-convex functions on \(R^m\)