Data envelope fitting with constrained polynomial splines

Abdelaati Daouia

doi:10.1111/rssb.12098

Return

Data envelope fitting with constrained polynomial splines

2014-12-26

Abdelaati Daouia

Hohsuk Noh *

Byeong U. Park

DOI：10.1111/rssb.12098

Original

Save

View PDF

Abstract

En 中文

Estimation of support frontiers and boundaries often involves monotone and/or concave edge data smoothing. This estimation problem arises in various unrelated contexts, such as optimal cost and production assessments in econometrics and master curve prediction in the reliability programmes of nuclear reactors. Very few constrained estimators of the support boundary of a bivariate distribution have been introduced in the literature. They are based on simple envelopment techniques which often suffer from lack of precision and smoothness. Combining the edge estimation idea of Hall, Park and Stern with the quadratic spline smoothing method of He and Shi, we develop a novel constrained fit of the boundary curve which benefits from the smoothness of spline approximation and the computational efficiency of linear programmes. Using cubic splines is also feasible and more attractive under multiple shape constraints; computing the optimal spline smoother is then formulated as a second-order cone programming problem. Both constrained quadratic and cubic spline frontiers have a similar level of computational complexity to those of the unconstrained fits and inherit their asymptotic properties. The utility of this method is illustrated through applications to some real data sets and simulation evidence is also presented to show its superiority over the best-known methods.

Keywords:

Boundary curve

Concavity

Least majorant

Linear programming

Monotone smoothing

Multiple shape constraints

Polynomial spline

Second-order cone programming

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.