Abstract
Nonlinear least squares problems over convex sets inR n are treated here by iterative methods which extend the classical Newton, gradient and steepest descent methods and the methods studied recently by Pereyra and the author. Applications are given to nonlinear least squares problems under linear constraint, and to linear and nonlinear inequalities.
Similar content being viewed by others
References
R. Bellman and R. Kalaba,Quasilinearization and Nonlinear Boundary-Value Problems, American Elsevier, New York, 1965.
A. Ben-Israel, A Newton Raphson Method for the Solution of Systems of Equations,J. Math. Anal. Appl. 15 (1966), 243–252.
A. Ben-Israel,On the Newton-Raphson Method, Systems Research Memorandum No. 162, Northwestern University, Evanston, September, 1966.
A. Ben-Israel and A. Charnes, Contributions to the Theory of Generalized Inverses,J. Soc. Indust. Appl. Math. 11 (1963), 667–699.
E. W. Cheney and A. A. Goldstein, Newton’s Method for Convex Programming and Tchebycheff Approximation,Numerische Mathematik,1 (1959), 253–268.
E. W. Cheney and A. A. Goldstein, Proximity Maps for Convex Sets,Proc. Amer. Math. Soc.,10 (1959), 448–450.
A. A. Goldstein,Minimizing Functionals on Hilbert Space, pp. 159–165 in A. V. Balakrishnan and L. W. Neustadt (ed.) Computing Methods in Optimization Problems,Academic Press, New York, 1964.
Y-C. Ho and R. L. Kashyap, A Class of Iterative Procedures for Linear Inequalities,J. SIAM Control 4 (1966), 112–115.
A. S. Householder,Principles of Numerical Analysis, McGraw-Hill, New York, 1953.
A. S. Householder,Theory of Matrices in Numerical Analysis, Blaisdell, New York, 1964.
D. W. Marquardt, An Algorithm for Least Squares Estimation of Nonlinear Parameters,J. Soc. Indust. Appl. Math. 11 (1963), 431–441.
D. A. Meeter, On a Theorem Used in Nonlinear Least Squares,J. SIAM Appl. Math. 14 (1966), 1176–1179.
J. J. Moreau, Proximité et Dualité dans un Espace Hilbertien,Bull. Soc. Math. France,93 (1965), 273–299.
D. D. Morrison,Methods for Nonlinear Least Squares Problems and Convergence Proofs, Proc. Jet Propulsion Lab. Seminar: Tracking Problems and Orbit Determination, 1–9, 1960.
R. Penrose, A Generalized Inverse for Matrices,Proc. Cambridge Philos. Soc. 51 (1955), 406–413.
V. Pereyra, Iterative Methods for Solving Nonlinear Least Squares Problems,SIAM J. Numer. Anal. 4 (1967), 27–36.
B. T. Poljak, Gradient Methods for Solving Equations and Inequalities,Z. Vycisl. Mat i Mat. Fiz. 4 (1964), 995–1005.
J. B. Rosen,Optimal Control and Convex Programming, pp. 223–237 in Proceedings of the IBM Sc entific Computing Symposium on Control Theory and Applications, T. J. Watson Research Center, Yorktown Heights, N. Y., October, 1964.
J. B. Rosen, Iterative Solution of Nonlinear Optimal Control Problems,J. SIAM Control 4 (1966), pp. 223–544.
W. J. Stiles, Closest-Point Maps and Their Products,Niew Archief voor Wiskunde (3)XIII (1965), pp. 19–29 and 212–225.
Author information
Authors and Affiliations
Additional information
Part of the research underlying this report was undertaken for the Office of Naval Research, Contract Nonr-1228(10), Project NR047-021, and for the U.S. Army Research Office — Durham, Contract No. DA-31-124-ARO-D-322 at Northwestern University. Reproduction of this paper in whole or in part is permitted for any purpose of the United States Government.
Rights and permissions
About this article
Cite this article
Ben-Israel, A. On iterative methods for solving nonlinear least squares problems over convex sets. Israel J. Math. 5, 211–224 (1967). https://doi.org/10.1007/BF02771609
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02771609