Finite alternation theorems and a constructive approach to piecewise polynomial approximation in Chebyshev norm (Q2174925)

The authors propose a new approach on deriving necessary and sufficient optimality conditions for Chebyshev polynomial approximation problems. This new approach is more intuitive than its predecessors and is based on a constructive method that leads to a new family of alternation-based algorithms for solving such problems. The approach is then extended in order to provide new local optimality conditions for free knot polynomial spline approximation problems, where the piecewise polynomials are required to be continuous on the approximation segment. Corresponding algorithms for solving such problems are provided, too, and the paper closes with some ideas for future research.