Least Squares Smoothing of Univariate Data to achieve Piecewise Monotonicity
From MaRDI portal
(Redirected from Publication:3350641)
Recommendations
- An adaptive algorithm for least squares piecewise monotonic data fitting
- Best L1 piecewise monotonic data modelling
- Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity
- Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
- An algorithm for constrained smoothing functions
Cited in
(14)- An adaptive algorithm for least squares piecewise monotonic data fitting
- Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity
- Sigmoid Data Fitting by Least Squares Adjustment of Second and Third Divided Differences
- A Characterization Theorem for the Discrete Best Monotonic Approximation Problem
- Monotone Data Smoothing by Quadratic Splines via Dualization
- A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints
- Projected gradient algorithms for optimization over order simplices
- On univariate function identification problems
- A theorem for piecewise convex-concave data approximation.
- Efficient Methods for Data Smoothing
- Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
- Multivariate epi-splines and evolving function identification problems
- 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: Least Squares Smoothing of Univariate Data to achieve Piecewise Monotonicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3350641)
