Construction of nearest points in the L^ p, p even, and L^ norms. I

DOI10.1016/0021-9045(70)90019-5MaRDI QIDQ2547690zbMATH OpenOpenAlexFDO

Authors L. A. Karlovitz

Publication date 1970

Published in Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0021-9045(70)90019-5

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Cites work

• Approximation theory and functional equations. II

Cited in

(11)

• Strong solvability in Orlicz spaces
• A remark on an algorithm for best L\(^p\) approximation
• A matrix-based IRLS algorithm for the least \(l_p\)-norm design of 2-D FIR filters
• Descent methods in smooth, rotund spaces with applications to approximation in L\(^p\)
• Iteratively reweighted least squares and slime mold dynamics: connection and convergence
• Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures
• A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems
• Generalized Mercer kernels and reproducing kernel Banach spaces
• Convex \(L^ p\) approximation
• Convex L^ p approximation
• Fast algorithms for _p-regression

This page was built for publication: Construction of nearest points in the \(L^ p\), p even, and \(L^ \infty\) norms. I

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