A decomposition theorem for the least squares piecewise monotonic data approximation problem

DOI10.1007/978-3-030-12767-1_7zbMATH Open1425.90069OpenAlexW2944444349MaRDI QIDQ2337595FDOQ2337595

Authors: Ioannis C. Demetriou 

Publication date: 20 November 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-12767-1_7

Recommendations

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

Mathematics Subject Classification ID

Integer programming (90C10)

Cited In (8)

• An adaptive algorithm for least squares piecewise monotonic data fitting
• An example of nondecomposition in data fitting by piecewise monotonic divided differences of order higher than two
• Best L1 piecewise monotonic data modelling
• A characterization theorem for the best \(L_1\) piecewise monotonic data approximation problem
• A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints
• Approximate dynamic programming using halfspace queries and multiscale Monge decomposition
• Separation theorems for the extrema of best piecewise monotonic approximations to successive data
• Least squares monotonic unimodal approximations to successively updated data and an application to a Covid-19 outbreak

This page was built for publication: A decomposition theorem for the least squares piecewise monotonic data approximation problem

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