A Characterization Theorem for the Discrete Best Monotonic Approximation Problem

DOI10.2307/2008799zbMath0696.41026OpenAlexW4230272157MaRDI QIDQ3472619

I. C. Demetriou

Publication date: 1990

Full work available at URL: https://doi.org/10.2307/2008799

zbMATH Keywords

best piecewise monotonic approxmationsdiscrete best monotonic approximationsdiscrete nonlinear optimization calculation

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Best approximation, Chebyshev systems (41A50) Approximation with constraints (41A29)

Related Items (2)

A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints ⋮ Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function

Cites Work

• Least Squares Smoothing of Univariate Data to achieve Piecewise Monotonicity
• Unnamed Item

This page was built for publication: A Characterization Theorem for the Discrete Best Monotonic Approximation Problem