Abstract
AbstractWe revisit the problem of computing optimal spline approximations for univariate least-squares splines from a combinatorial optimization perspective. In contrast to most approaches from the literature we aim at globally optimal coefficients as well as a globally optimal placement of a fixed number of knots for a discrete variant of this problem. To achieve this, two different possibilities are developed. The first approach that we present is the formulation of the problem as a mixed-integer quadratically constrained problem, which can be solved using commercial optimization solvers. The second method that we propose is a branch-and-bound algorithm tailored specifically to the combinatorial formulation. We compare our algorithmic approaches empirically on both, real and synthetic curve fitting data sets from the literature. The numerical experiments show that our approach to tackle the least-squares spline approximation problem with free knots is able to compute solutions to problems of realistic sizes within reasonable computing times.
Funder
Hochschule für Wirtschaft und Gesellschaft Ludwigshafen
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference36 articles.
1. Beliakov, G.: Least squares splines with free knots: global optimization approach. Appl. Math. Comput. 149(3), 783–798 (2004)
2. Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont, MA (1997)
3. Brusco, M.J., Stahl, S.: Branch-and-Bound Applications in Combinatorial Data Analysis. Statistics and Computing. Springer, New York, NY (2005)
4. IBM ILOG CPLEX V12.7, Users manual for CPLEX. International Business Machines Corporation (2017)
5. Cox, M.G.: The least squares solution of overdetermined linear equations having band or augmented band structure. IMA J. Numer. Anal. 1(1), 3–22 (1981)