A note on the regularization of discrete approximation problems
The results on discretization errors in nonlinear approximation problems obtained by the author earlier [J. Approximation Theory 49, 256-273 (1987; Zbl 0613.41016)] are extended. In general the discrete approximation problem may have no solution. And the discretization errors may not converge, even if the uniform approximation problem possesses a unique solution. It is shown, that some discrete problem can be ``regularized in such way, that these pathologies do not take place. Besides if in these cases the uniform approximation problem possesses a unique solution, then the discretization errors tend to zero.
- Combined lp and quasi-Newton methods for minimax optimization
- Combined LP and Quasi-Newton Methods for Nonlinear $l_1 $ Optimization
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 45001 (Why is no real title available?)
- scientific article; zbMATH DE number 3269388 (Why is no real title available?)
- Linearly constrained minimax optimization
- Modifications of the First Remez Algorithm
- On discretization errors in nonlinear approximation problems
- Discretization methods for the solution of semi-infinite programming problems
- On discretization errors in nonlinear approximation problems
- ON CONVERGENCE IN DISCRETIZED MINIMIZATION PROBLEMS*
- scientific article; zbMATH DE number 17908 (Why is no real title available?)
- Discrete approximations of minimization problems. II. Applications
- Discretization of regularized integral equations in L ∞
- All well-posed problems have uniformly stable and convergent discretizations
This page was built for publication: A note on the regularization of discrete approximation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q921320)