Separation theorems for the extrema of best piecewise monotonic approximations to successive data

DOI10.1080/10556788.2019.1613653MaRDI QIDQ5113709zbMATH OpenOpenAlexWikidataFDO

Authors Ioannis C. Demetriou

Publication date 16 June 2020

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2019.1613653

zbMATH Keywords

approximationdata smoothingdivided differenceextremummonotonicpeakfindingpiecewise monotonicsunspotsturning point

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
• An example of nondecomposition in data fitting by piecewise monotonic divided differences of order higher than two
• A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints
• Best L1 piecewise monotonic data modelling
• A decomposition theorem for the least squares piecewise monotonic data approximation problem

Cites work

• Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
• Least Squares Smoothing of Univariate Data to achieve Piecewise Monotonicity
• On univariate function identification problems
• Recursive computation of piecewise constant volatilities

Cited in

(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

Describes a project that uses

Uses Software

• L2WPMA

This page was built for publication: Separation theorems for the extrema of best piecewise monotonic approximations to successive data

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