A Spline Smoothing Newton Method for L∞ Distance Regression with Bound Constraints
Author(s) -
Li Dong,
Bo Yu
Publication year - 2013
Publication title -
isrn operations research
Language(s) - English
Resource type - Journals
ISSN - 2314-6397
DOI - 10.1155/2013/393482
Subject(s) - algorithm , smoothing , computer science , smoothing spline , mathematics , artificial intelligence , statistics , spline interpolation , bilinear interpolation
Orthogonal distance regression is arguably the most common criterion for fitting a model to data with errors in the observations. It is not appropriate to force the distances to be orthogonal, when angular information is available about the measured data points. We consider here a natural generalization of a particular formulation of that problem which involves the replacement of norm by norm. This criterion may be a more appropriate one in the context of accept/reject decisions for manufacture parts. For distance regression with bound constraints, we give a smoothing Newton method which uses cubic spline and aggregate function, to smooth max function. The main spline smoothing technique uses a smooth cubic spline instead of max function and only few components in the max function are computed; hence it acts also as an active set technique, so it is more efficient for the problem with large amounts of measured data. Numerical tests in comparison to some other methods show that the new method is very efficient.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom