Approximations in $L^p $ and Chebyshev Approximations

From MaRDI portal
Publication:5330780

DOI10.1137/0111074zbMath0125.31004OpenAlexW2038810925MaRDI QIDQ5330780

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




Related Items

Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensionsSelecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraintsDependence on p of the best \(L^ p\) approximation operatorThe Pólya algorithm on tubular setsStrict Chebyshev approximation for general systems of linear equationsBest approximation in Köthe-Bochner spacesComputing the Strict Chebyshev Solution of Overdetermined Linear EquationsThe linear discrete Pólya algorithmThe Polya algorithm on cylindrical setsA fuzzy constraint-based approach to data reconciliation in material flow analysisProperties of the strict Chebyshev solutions of the linear matrix equation \(AX+YB=C\)A strict best approximant by non-decreasing functionsAsymptotic behaviour of best \(l_p\)-approximations from affine subspacesPolya properties in\(n\)-best kernel approximation in reproducing kernel Hilbert spacesA simplex based algorithm for the lexicographically extended linear maxmin problemApproximation in the \(\ell_{\infty}\) norm and the generalized inverseContinuous selections and convergence of best Lp–approximations in subspaces of spline functionsLinear Chebyshev approximation without Chebyshev setsLeximin optimality and fuzzy set-theoretic operations.Rate of convergence of the linear discrete Pólya algorithmAsymptotic expression of the linear discrete best \(\ell_{p}\)-approximationThe Pólya algorithm on convex setsRate of convergence of the discrete Pólya algorithmThe limit of best generalized peak norm approximationsA local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functionsUniform Lipschitz continuity of best \(l_p\)-approximations by polyhedral setsThe Chebyshev solution of the linear matrix equation \(AX+YB=C\)The Polya algorithm for convex approximationChebyshev approximations in subspaces of spline functionsThe continuity and differentiability of the parameters of best linear L\(_p\) approximationsThe Pólya algorithm in sequence spacesRate of convergence of the Pólya algorithm from polyhedral setsStrong solvability in Orlicz spacesApproximation in normed linear spacesCharacterization of strict approximations in subspaces of spline functionsComputing improved optimal solutions to max-min flexible constraint satisfaction problemsThe 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\)-approximationLp approximation of variational problems in L1 and L∞On best \(p\)-approximation from affine subspaces: Asymptotic expansion