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

DOI10.1016/0021-9045(76)90031-9zbMath0352.41029OpenAlexW2009837763MaRDI QIDQ1235862

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)

Related Items (1)

A class of programming problems whose objective function contains a norm

Cites Work

• Unnamed Item
• Unnamed Item
• Best approximation with respect to nearby norms
• Uniqueness of Hahn-Banach Extensions and Unique Best Approximation
• Characterizations of Best Complex Chebyshev Approximate Solutions of $Av = b$

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