Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

A characterization theorem for the discrete best monotonic approximation problem


Author: I. C. Demetriou
Journal: Math. Comp. 55 (1990), 191-195
MSC: Primary 65D15
DOI: https://doi.org/10.1090/S0025-5718-1990-1023046-3
MathSciNet review: 1023046
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A characterization theorem is derived that motivates a procedure for generating discrete best monotonic approximations to n sequential data values, when a strictly convex objective function is used in the calculation. The procedure is highly useful in the discrete nonlinear optimization calculation that produces the best piecewise monotonic approximations to the data.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65D15

Retrieve articles in all journals with MSC: 65D15


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1990-1023046-3
Keywords: Data smoothing, monotonic
Article copyright: © Copyright 1990 American Mathematical Society