A characterization theorem for the discrete best monotonic approximation problem
HTML articles powered by AMS MathViewer
- by I. C. Demetriou PDF
- Math. Comp. 55 (1990), 191-195 Request permission
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
- M. P. Cullinan and M. J. D. Powell, Data smoothing by divided differences, Numerical analysis (Dundee, 1981) Lecture Notes in Math., vol. 912, Springer, Berlin-New York, 1982, pp. 26–37. MR 654340 I. C. Demetriou, Data smoothing by piecewise monotonic divided differences, Ph. D. Dissertation, University of Cambridge, 1985.
- I. C. Demetriou and M. J. D. Powell, Least squares smoothing of univariate data to achieve piecewise monotonicity, IMA J. Numer. Anal. 11 (1991), no. 3, 411–432. MR 1118965, DOI 10.1093/imanum/11.3.411
Additional Information
- © Copyright 1990 American Mathematical Society
- Journal: Math. Comp. 55 (1990), 191-195
- MSC: Primary 65D15
- DOI: https://doi.org/10.1090/S0025-5718-1990-1023046-3
- MathSciNet review: 1023046