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

DOI10.1080/10556788.2019.1613653zbMath1440.90093OpenAlexW2946334506WikidataQ127873769 ScholiaQ127873769MaRDI QIDQ5113709

I. C. Demetriou

Publication date: 16 June 2020

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

approximationturning pointsunspotsdivided differenceextremumdata smoothingmonotonicpiecewise monotonicpeakfinding

Mathematics Subject Classification ID

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

Related Items (1)

A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints

Uses Software

• L2WPMA

Cites Work

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

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