Piecewise Convex Function Estimation and Model Selection

MaRDI QIDQ4486612zbMATH OpenFDO

Authors Kurt S. Riedel

Publication date 27 June 2000

Full work available at URL https://arxiv.org/abs/1803.03903

Mathematics Subject Classification ID

Approximation with constraints (41A29)

Abstract: Given noisy data, function estimation is considered when the unknown function is known apriori to consist of a small number of regions where the function is either convex or concave. When the regions are known apriori, the estimate is reduced to a finite dimensional convex optimization in the dual space. When the number of regions is unknown, the model selection problem is to determine the number of convexity change points. We use a pilot estimator based on the expected number of false inflection points.

Recommendations

• Piecewise convex function estimation: Pilot estimators
• Nonparametric estimation of piecewise smooth regression functions
• scientific article; zbMATH DE number 5770648
• Convex piecewise-linear fitting
• Adaptive estimation of planar convex sets

Cited in

(2)

• Piecewise convex function estimation: Pilot estimators
• Estimating the Probability that a Function Observed with Noise Is Convex

This page was built for publication: Piecewise Convex Function Estimation and Model Selection

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