On semi-infinite optimization and chebyshev approximation with contraints

From MaRDI portal





The methods of semi-infinite optimization are used in order to study Chebyshev approximation with constraints. In particular, best approximation by subspaces which do not satisfy the Haar condition is studied. An approximation problem associated with a minimization problem is given. Many of the standard constraints are contained in this approximation problem, e.g. simultaneous Chebyshev approximation, restricted range approximation, bounded coefficients approximation. Then a characterization theorem for best approximations of this problem is given. The result is applied to weak Chebyshev subspaces and weak Markoff subspaces. The best known examples of such subspaces are spaces of spline functions. Moreover, an algorithm is given which computes the best approximations for the above-mentioned problems.











This page was built for publication: On semi-infinite optimization and chebyshev approximation with contraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3346756)