Shape constrained smoothing using smoothing splines |
| |
Authors: | Berwin A. Turlach |
| |
Affiliation: | (1) School of Mathematics and Statistics (M019), The University of Western Australia, 35 Stirling Highway, 6009 Crawley, WA, Australia |
| |
Abstract: | Summary In some regression settings one would like to combine the flexibility of nonparametric smoothing with some prior knowledge about the regression curve. Such prior knowledge may come from a physical or economic theory, leading to shape constraints such as the underlying regression curve being positive, monotone, convex or concave. We propose a new method for calculating smoothing splines that fulfill these kinds of constraints. Our approach leads to a quadratic programming problem and the infinite number of constraints are replaced by a finite number of constraints that are chosen adaptively. We show that the resulting problem can be solved using the algorithm of Goldfarb and Idnani (1982, 1983) and illustrate our method on several real data sets. |
| |
Keywords: | Concavity constrained smoothing convexity monotonicity nonparametric smoothing quadratic programming splines |
本文献已被 SpringerLink 等数据库收录! |
|