Least squares splines with free knots: Global optimization approach.

DOI10.1016/S0096-3003(03)00179-6zbMath1038.65051MaRDI QIDQ1426188

Gleb Beliakov

Publication date: 14 March 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

AlgorithmNumerical experimentsCutting angle methodLeast squares splinesGlobal optimisationRegression splinesSplines with free knots

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Pseudo-inverses of difference matrices and their application to sparse signal approximation ⋮ The unimodality of initial B-spline approximations in spline fitting ⋮ Knot Placement for B-Spline Curve Approximation via $L_{∞, 1}$-Norm and Differential Evolution Algorithm ⋮ Data approximation by \(L^1\) spline fits with free knots ⋮ Geometrically designed variable knot splines in generalized (non-)linear models ⋮ Globally optimal univariate spline approximations ⋮ Interval-based reasoning over continuous variables using independent component analysis and Bayesian networks ⋮ Knot calculation for spline fitting based on the unimodality property ⋮ Nonlinear least-squares spline fitting with variable knots ⋮ Geometrically designed, variable knot regression splines

Uses Software

• FITPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constrained approximation by splines with free knots
• A practical guide to splines
• The sensitivity of a spline function to perturbations of the knots
• Shape-preserving knot removal
• Cutting angle methods in global optimization
• Fast algorithm for the cutting angle method of global optimization
• Introduction to global optimization
• Least squares approximation by splines with free knots
• An algorithm for finding the global maximum of a multimodal, multivariate function
• A Data-Reduction Strategy for Splines with Applications to the Approximation of Functions and Data
• Algorithms for Piecewise Polynomials and Splines with Free Knots
• On the Best Least Squares Approximation of Continuous Functions using Linear Splines with Free Knots
• Approximation to Data by Splines with Free Knots
• Lipschitz programming via increasing convex-along-rays functions^*
• An algorithm for data reduction using splines with free knots
• Global optimization
• Global minimization of increasing positively homogeneous functions over the unit simplex
• Abstract convexity and global optimization