Least squares splines with free knots: global optimization approach
Data(s) |
22/02/2004
|
---|---|
Resumo |
Splines with free knots have been extensively studied in regard to calculating the optimal knot positions. The dependence of the accuracy of approximation on the knot distribution is highly nonlinear, and optimisation techniques face a difficult problem of multiple local minima. The domain of the problem is a simplex, which adds to the complexity. We have applied a recently developed cutting angle method of deterministic global optimisation, which allows one to solve a wide class of optimisation problems on a simplex. The results of the cutting angle method are subsequently improved by local discrete gradient method. The resulting algorithm is sufficiently fast and guarantees that the global minimum has been reached. The results of numerical experiments are presented.<br /><br /><br /> |
Identificador | |
Idioma(s) |
eng |
Publicador |
Elsevier |
Relação |
http://dro.deakin.edu.au/eserv/DU:30002355/beliakov-leastsquares-2003.pdf http://dro.deakin.edu.au/eserv/DU:30002355/beliakov-leastsquares-post-2003.pdf http://dx.doi.org/10.1016/S0096-3003(03)00179-6 |
Direitos |
2003, Elsevier |
Palavras-Chave | #least squares splines #regression splines #splines with free knots #global optimisation #cutting angle method |
Tipo |
Journal Article |