Approximations in L^p and Chebyshev Approximations
From MaRDI portal
Publication:5330780
DOI10.1137/0111074zbMATH Open0125.31004OpenAlexW2038810925MaRDI QIDQ5330780FDOQ5330780
Authors: Jean Descloux
Publication date: 1964
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0111074
Cited In (42)
- Lp approximation of variational problems in L1 and L∞
- Properties of the strict Chebyshev solutions of the linear matrix equation \(AX+YB=C\)
- Strict Chebyshev approximation for general systems of linear equations
- On best \(p\)-approximation from affine subspaces: Asymptotic expansion
- The limit of best generalized peak norm approximations
- Continuous selections and convergence of best Lp–approximations in subspaces of spline functions
- Approximation in normed linear spaces
- Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
- Uniform Lipschitz continuity of best \(l_p\)-approximations by polyhedral sets
- Approximation in the \(\ell_{\infty}\) norm and the generalized inverse
- Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions
- The linear discrete Pólya algorithm
- A simplex based algorithm for the lexicographically extended linear maxmin problem
- A fuzzy constraint-based approach to data reconciliation in material flow analysis
- The Pólya algorithm in sequence spaces
- The continuity and differentiability of the parameters of best linear L\(_p\) approximations
- A strict best approximant by non-decreasing functions
- Rate of convergence of the linear discrete Pólya algorithm
- Asymptotic behaviour of best \(l_p\)-approximations from affine subspaces
- Best approximation in Köthe-Bochner spaces
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems
- Chebyshev approximations in subspaces of spline functions
- Dependence on p of the best \(L^ p\) approximation operator
- The Polya algorithm on cylindrical sets
- Computing the Strict Chebyshev Solution of Overdetermined Linear Equations
- Polya properties in
- The Pólya algorithm on tubular sets
- Rate of convergence of the Pólya algorithm from polyhedral sets
- Rate of convergence of the discrete Pólya algorithm
- The Pólya algorithm on convex sets
- A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions
- Asymptotic expression of the linear discrete best \(\ell_{p}\)-approximation
- The Polya algorithm for convex approximation
- The Chebyshev solution of the linear matrix equation \(AX+YB=C\)
- Linear Chebyshev approximation without Chebyshev sets
- Strong solvability in Orlicz spaces
- Leximin optimality and fuzzy set-theoretic operations.
- Characterization of strict approximations in subspaces of spline functions
- The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
- On a particular case of the inconsistent linear matrix equation \(AX+YB=C\)
- The Chebyshev approximation of a rectangular matrix by matrices of smaller rank as the limit of \(\ell_p\)-approximation
- \(n\)-best kernel approximation in reproducing kernel Hilbert spaces
This page was built for publication: Approximations in $L^p $ and Chebyshev Approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5330780)