A Characterization Theorem for the Discrete Best Monotonic Approximation Problem

DOI10.2307/2008799MaRDI QIDQ3472619zbMATH OpenOpenAlexFDO

Authors Ioannis 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

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

Recommendations

• A characterization theorem for the best \(L_1\) piecewise monotonic data approximation problem
• Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
• scientific article; zbMATH DE number 4198727
• The computation of a best monotoneL_papproximation for 1 ≤p< ∞
• On the characterization and computation of best monotone approximation in \(L_ p[0,1]\) for \(1\leq p<\infty\)

Cites work

• scientific article; zbMATH DE number 3784187 (Why is no real title available?)
• Least Squares Smoothing of Univariate Data to achieve Piecewise Monotonicity

Cited in

(4)

• Preorderings, monotone functions, and best rank \(r\) approximations with applications to classical MDS
• 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
• A characterization theorem for the best \(L_1\) piecewise monotonic data approximation problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3472619)