Hostname: page-component-848d4c4894-hfldf Total loading time: 0 Render date: 2024-05-11T07:59:10.129Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on least-squares approximation with range constraints

Published online by Cambridge University Press:  17 February 2009

R. J. Evans  and
A. Cantoni
A. Cantoni
Affiliation:
Department of Electrical Engineering, University of Newcastle, N.S.W. 2308, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this note we consider various theoretical aspects of the problem of least-squares approximation subject to constraints on the range of the approximating polynomial. The problem is treated from an optimization theory viewpoint. Rice's parameter space procedure is discussed.

Type
Research Article
Information
The ANZIAM Journal , Volume 21 , Issue 2 , August 1979 , pp. 230 - 242
Copyright
Copyright © Australian Mathematical Society 1979

References

[1]Cheney, E., Introduction to approximation theory (New York: McGraw-Hill, 1966).Google Scholar
[2]Dunford, N. and Schwartz, I., Linear operators. Part I (New York: Interscience, 1958).Google Scholar
[3]Ekland, I. and Terman, R., Convex analysis and variational problems (Berlin: Springer-Verlag, 1976).Google Scholar
[4]Fortmann, T. E. and Evans, R. J., “Optimal filter design subject to output sidelobe constraints”, J. Opt. Theory Applics 14 (1974), 271–290.CrossRefGoogle Scholar
[5]Kantorovich, L. and Akilov, G., Functional analysis in normed spaces (New York: Pergamon, 1964).Google Scholar
[6]Krabs, W., “Fehlerquadrat-Approximation als Mittel zur Losung des diskreten linearen Tschebyscheff-Problems”, Z. Angew. Math. Mech. 44 (1964), 42–45.CrossRefGoogle Scholar
[7]Lewis, J., “Approximation with convex constraints”, SIAM Review 15 (1973), 193–217.CrossRefGoogle Scholar
[8]Loeb, H., Moursund, D. and Raylor, G., “Uniform rational weighted approximation having restricted ranges”, J. Approx. Theory 1(1968), 401–411.CrossRefGoogle Scholar
[9]Luenberger, D., Optimization by vector space methods (Wiley, 1969).Google Scholar
[10]Rabinowitz, P., “Mathematical programming”, in Approximation theory, (ed. Talbot, A.) (London: Academic Press, 1970).Google Scholar
[11]Rice, J., “Approximation with convex constraints”, SIAM J. Control 11 (1963), 15–32.Google Scholar
[12]Schumaker, L. and Taylor, G., “On approximation by polynomials having restricted ranges II”, SIAM J. Num. Anal. 6 (1969), 31–36.CrossRefGoogle Scholar
[13]Taylor, G., “On approximation by polynomials having restricted ranges”, SIAM J. Num. Anal. 5 (1968), 258–268.CrossRefGoogle Scholar
[14]Taylor, G., “Approximation by functions having restricted ranges III”. J. Math. Anal. Appl. 27 (1969), 241–248.CrossRefGoogle Scholar
[15]Wahba, G., “On the minimization of a quadratic functional subject to a continuous family of linear inequality constraints”, SIAM J. Control 11 (1973), 64–79.CrossRefGoogle Scholar
[16]Watson, G. A., “The calculation of best restricted approximations”, SIAM J. Num. Anal. 11 (1974), 693–699.CrossRefGoogle Scholar