An example of nondecomposition in data fitting by piecewise monotonic divided differences of order higher than two

DOI10.1007/978-3-319-99142-9_17MaRDI QIDQ2325263zbMATH OpenOpenAlexFDO

Authors Ioannis C. Demetriou

Publication date 9 September 2019

Full work available at URL https://doi.org/10.1007/978-3-319-99142-9_17

zbMATH Keywords

approximationcombinatoricsdata fittingdecompositiondivided differencesdynamic programmingleast squarespiecewise convexity/concavitypiecewise monotonicitysmoothing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity
• A decomposition theorem for the least squares piecewise monotonic data approximation problem
• Best L1 piecewise monotonic data modelling
• scientific article; zbMATH DE number 1971710
• A characterization theorem for the best \(L_1\) piecewise monotonic data approximation problem

Cited in

(2)

• A decomposition theorem for the least squares piecewise monotonic data approximation problem
• Separation theorems for the extrema of best piecewise monotonic approximations to successive data

This page was built for publication: An example of nondecomposition in data fitting by piecewise monotonic divided differences of order higher than two

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