Abstract
A class of polyhedral norms is introduced, which contains thel 1 andl ∞ norms as special cases. Of primary interest is the solution of linear best approximation problems using these norms. Best approximations are characterized, and an algorithm is developed. This is a methods of descent type which may be interpreted as a generalization of existing well-known methods for solving thel 1 andl ∞ problems. Numerical results are given to illustrate the performance of two variants of the algorithm on some problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.H. Anderson and M.R. Osborne, Discrete, linear approximation problems in polyhedral norms, Num. Math. 28 (1976) 179–189.
R.H. Bartels, A.R. Conn and C. Charalambous, On Cline's direct method for solving overdetermined systems in thel ∞ sense, SIAM J. Num. Anal. 15 (1978) 255–270.
R.H. Bartels, A.R. Conn and J.W. Sinclair, Minimization techniques for piecewise differentiable functions: thel 1 solution to an overdetermined linear system, SIAM J. Num. Anal. 15 (1978) 224–241.
M.R. Osborne,Finite Algorithms in Optimization and Data Analysis (Wiley, Chichester, 1985).
R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, 1970).
G.A. Watson,Approximation Theory and Numerical Methods (Wiley, Chichester, 1980).
Author information
Authors and Affiliations
Additional information
Communicated by C. Brezinski
Rights and permissions
About this article
Cite this article
Watson, G.A. Linear best approximation using a class of polyhedral norms. Numer Algor 2, 321–335 (1992). https://doi.org/10.1007/BF02139472
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02139472