Formulation of Linear Programs in Analysis. I: Approximation Theory

DOI10.1137/0116054MaRDI QIDQ5579704zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(17)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5579704)