Formulation of Linear Programs in Analysis. I: Approximation Theory

DOI10.1137/0116054zbMath0186.11002OpenAlexW2093240802MaRDI QIDQ5579704

L. A. Karlovitz, Richard J. Duffin

Publication date: 1968

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0116054

zbMATH Keywords

approximation and series expansion

Related Items (15)

Characterizing best isotone approximations in \(L_p\) spaces, \(1 \leq p < \infty\) ⋮ Completeness, precompactness and compactness in finite-dimensional asymmetrically normed lattices ⋮ Existence, uniqueness, and stability of best and near-best approximations ⋮ Strict protosuns in asymmetric spaces of continuous functions ⋮ The norm of a linear functional with respect to a non-negative convex functional vanishing at the origin ⋮ A characterization of completeness via absolutely convergent series and the Weierstrass test in asymmetric normed semilinear spaces ⋮ Numerical treatment of a class of semi‐infinite programming problems ⋮ Unnamed Item ⋮ Approximation with constraints in normed linear spaces ⋮ Zur Theorie der nichtlinearen Tschebyscheff-Approximation mit Nebenbedingungen ⋮ Nichtlineare Tschebyscheff-Approximation mit Nebenbedingungen: Anwendungen ⋮ Asymptotic duality over closed convex sets ⋮ Extension with larger norm and separation with double support in normed linear spaces ⋮ Best approximation as a solution of a game ⋮ Least-squares approximation with restricted range

This page was built for publication: Formulation of Linear Programs in Analysis. I: Approximation Theory