|Start Page Number:||536|
|End Page Number:||549|
|Publication Date:||Nov 2016|
|Journal:||Journal of Optimization Theory and Applications|
|Authors:||Sukhorukova Nadezda, Ugon Julien|
|Keywords:||heuristics, programming: convex|
In this paper, we derive conditions for best uniform approximation by fixed knots polynomial splines with weighting functions. The theory of Chebyshev approximation for fixed knots polynomial functions is very elegant and complete. Necessary and sufficient optimality conditions have been developed leading to efficient algorithms for constructing optimal spline approximations. The optimality conditions are based on the notion of alternance (maximal deviation points with alternating deviation signs). In this paper, we extend these results to the case when the model function is a product of fixed knots polynomial splines (whose parameters are subject to optimization) and other functions (whose parameters are predefined). This problem is nonsmooth, and therefore, we make use of convex and nonsmooth analysis to solve it.