Best approximation with respect to nearby norms
From MaRDI portal
(Redirected from Publication:2394724)
Cites work
Cited in
(28)- Strong solvability in Orlicz spaces
- Problème inverse du lieu des meilleures approximations linéaires
- Varying norms and constraints
- Deviation of best discrete and uniform polynomial approximants
- Parametric approximation
- Convergence from approximating subspaces
- Best approximation using a peak norm
- A cutting plane method for solving minimax problems in the complex plane
- A generalized Polya algorithm
- The limit of mean transformed rational approximation on subsets
- Algorithms for solving the dual problem for Av = b with varying norms
- Nearby linear Chebyshev approximation
- Nearby Chebyshev (powered) rational approximation
- Best approximation in Köthe-Bochner spaces
- Best L//1-approximation on finite point sets: Rate of convergence
- Variation of the norms in the problem of best approximation
- Some problems of A. Kroó on multiple Chebyshev polynomials
- Approximation of norms
- Continuity and condition of the linear approximation problem. I
- Perturbations of best approximation problems
- ON CONVERGENCE IN DISCRETIZED MINIMIZATION PROBLEMS*
- Continuous selections and convergence of best Lp–approximations in subspaces of spline functions
- Discrete approximations of minimization problems. II. Applications
- Convergence of function averages in orlicz spaces
- Construction of Gauss-Christoffel Quadrature Formulas
- Orthogonal and L_q-extremal polynomials on inverse images of polynomial mappings
- Design approximation problems for linear-phase nonrecursive digital filters
- Discretization for uniform polynomial approximation
This page was built for publication: Best approximation with respect to nearby norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2394724)
