.png){kind=icon}
.png){kind=icon}
Return
A more efficient algorithm for Convex Nonparametric Least Squares
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2012.11.054.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Convex Nonparametric Least Squares (CNLSs) is a nonparametric regression method that does not require a priori specification of the functional form. The CNLS problem is solved by mathematical programming techniques; however, since the CNLS problem size grows quadratically as a function of the number of observations, standard quadratic programming (QP) and Nonlinear Programming (NLP) algorithms are inadequate for handling large samples, and the computational burdens become significant even for relatively small samples. This study proposes a generic algorithm that improves the computational performance in small samples and is able to solve problems that are currently unattainable. A Monte Carlo simulation is performed to evaluate the performance of six variants of the proposed algorithm. These experimental results indicate that the most effective variant can be identified given the sample size and the dimensionality. The computational benefits of the new algorithm are demonstrated by an empirical application that proved insurmountable for the standard QP and NLP algorithms. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Convex Nonparametric Least Squares
Frontier estimation
Productive efficiency analysis
Model reduction
Computational complexity
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W