Summary
We present the theory of the linear least squares problem with a quadratic constraint. New theorems characterizing properties of the solutions are given. A numerical application is discussed.
Similar content being viewed by others
References
Elden, L.: Algorithms for the regularisation and constrained least squares methods. Bit17, 134–145 (1977)
Forsythe, G.E., Golub, G.H.: On the stationary values of a second degree polynomial on the unit sphere. J. Soc. Indust. Appl. Math.13, 1050–1068 (1965)
Gander, W.: On the linear least squares problem with a quadratic constraint. Habilitationsschrift ETH Zürich. STAN-CS-78-697, Stanford University, 1978
Golub, G.H., Heath, M., Wahba, G.: Generalized cross-validation. Technometrics21, 215–223 (1979)
Kahan, W.: Manuscript in Box 5G of the G. Forsythe Archive, Stanford Main Library (∼1965)
Lawson, C.L., Hanson, R.J.: Solving least squares problems. Englewood Cliffs, N.J.: Prentice Hall 1974
Marquardt, D.W.: An algorithm for least-squares estimation of nonlinear parameters. SIAM J. Appl. Math.11, 431–441 (1963)
Moré, J.J.: The Levenberg-Marquardt algorithm: implementation and theory. Dundee Conference on Numerical Analysis (1977)
Reinsch, C.H.: Smoothing by spline functions. Numer. Math.10, 177–183 (1967)
Rutishauser, H.: Once again: the least square problem. Linear Algebra and Appl.1, 479–488 (1968)
Rutishauser, H.: Vorlesungen über Numerische Mathematik. (M. Gutknecht, Hrsg.) Basel: Birkhäuser 1976
Spjøtvoll, E.: A note on a théorem of Forsythe and Golub. SIAM J. Appl. Math.23, 307–311 (1972)
Tikhonov, A.N., Arsenin, V.Y.: Solution of ill posed problems. New York: Wiley, 1977
Van Loan, C.F.: Generalizing the singular value decomposition. SIAM J. Numer. Anal.13, 76–83 (1976)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gander, W. Least squares with a quadratic constraint. Numer. Math. 36, 291–307 (1980). https://doi.org/10.1007/BF01396656
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01396656