Optimization Online


Data Approximation by L1 Spline Fits with Free Knots

Ziteng Wang(zwang3***at***niu.edu)
Manfei Xie(manfei***at***vt.edu)

Abstract: L1 spline fits are a class of spline models that have shown advantages in approximating irregular and multiscale data. This paper investigates the knot placement problem of L1 spline fits under two scenarios. If the number of knots is given, we propose an augmented Lagrangian method to solve the bilevel L1 spline fit problem and consequently, optimize the knot locations. In addition, if the knot number is also free, we propose a heuristic method to adaptively determine the knot number and locations. Numerical experiments show that L1 spline fits with free knots can better approximate data than L1 spline fits with pre-specified knots while requiring fewer knots and less input from the user. Comparison with state-of-the-art least square B-spline models shows that L1 spline fits can approximate data with comparable squared error and significantly smaller absolute error.

Keywords: spline; knot; approximation; optimization; algorithm

Category 1: Applications -- Science and Engineering

Category 2: Nonlinear Optimization

Category 3: Applications -- OR and Management Sciences


Download: [PDF]

Entry Submitted: 04/27/2020
Entry Accepted: 04/27/2020
Entry Last Modified: 04/27/2020

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society