Algorithms for solving the dual problem for Av = b with varying norms

DOI10.1016/0021-9045(76)90031-9MaRDI QIDQ1235862zbMATH OpenOpenAlexFDO

Authors Michael S. Borowsky

Publication date 1976

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

Full work available at URL https://doi.org/10.1016/0021-9045(76)90031-9

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50)

Cites work

• scientific article; zbMATH DE number 3237219 (Why is no real title available?)
• scientific article; zbMATH DE number 3258269 (Why is no real title available?)
• Best approximation with respect to nearby norms
• Characterizations of Best Complex Chebyshev Approximate Solutions of $Av = b$
• Uniqueness of Hahn-Banach Extensions and Unique Best Approximation

Cited in

(1)

• A class of programming problems whose objective function contains a norm

This page was built for publication: Algorithms for solving the dual problem for Av = b with varying norms

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