Summary
In the paper, a special approximated Newton method for minimizing a sum of squares \(f\left( \mathfrak{x} \right) = \frac{1} {2}\left\| {f\left( \mathfrak{x} \right)} \right\|^2 = \frac{1} {2}\Sigma _{i = 1}^m \left[ {F_i \left( \mathfrak{x} \right)} \right]^2 \) is introduced. In this Restricted Newton method, the Hessian \(H = G + S\) of f where \(G = \left( {F'} \right)^T F',S = F \circ F''\) , is approximated by \(A_{RN} = G + B\) where \(B = Z_2 Z_2^T SZ_2 Z_2^T \) is the restriction of the second order term S on the subspace im Z2 spanned by the eigenvectors of the Gauss-Newton matrix G which belong to the q smallest eigenvalues of G. Some properties of this approximation are derived, and a related trust region method is tested on hand of some test functions from the literature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Adam, Quadratische Modelle zur Lösung nichtlinearer Quadratmit-telprobleme, Diplomarbeit, Institut für Numerische Mathematik, Techn. Univ. Dresden, Germany, 1996.
M. Al-Baali and R. Fletcher, An efficient line search for nonlinear least squares, J. Optim. Theory Appl., 48 (1986), pp. 359–377.
A. R. Conn, N. I. M. Gould, and P. L. Toint, Trust-Region Methods, SIAM, Philadelphia, 2000.
J. E. Dennis, D. Gay, and R. Welsch, An adaptive nonlinear least squares algorithm, ACM Trans. Math. Software, 7 (1981), pp. 348–368.
J. E. Dennis, H. J. Martínez, and R. A. Tapia, A convergence theory for the structured BFGS secant method with an application to nonlinear least squares, J. Optim. Theory Appl., 61 (1989), pp. 159–176.
A. Griewank, Evaluating Derivatives. Principles and Techniques of Algorithmic Differentiation, SIAM, Philadelphia, 2000.
R. Lösche, H. Schwetlick, and G. Timmermann, A modified block Newton iteration for approximating an invariant subspace of a symmetric matrix, Linear Algebra Appl., 275/276 (1998), pp. 381–400.
J. J. Moré, B. S. Garbow, and K. E. Hillstrom, Testing unconstrained optimization software, ACM Trans. Math. Software, 7 (1981), pp. 17–41.
L. Nazareth, Some recent approaches to solving large residual nonlinear least squares problems, SIAM Rev., 22 (1980), pp. 1–11.
J. Nocedal and S. J. Wright, Numerical Optimization, Springer, New York, 1999.
J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, London, 1970. Republished 2000 by SIAM, Philadelphia.
E. Spedicato and M. T. Vespucci, Numerical experiments with variations of the Gauss-Newton algorithm for nonlinear least squares, J. Optim. Theory Appl., 57 (1988), pp. 323–339.
H. Yabe, Variations of structured Broyden families for nonlinear least squares problems, Optimization Methods and Software, 2 (1993), pp. 107–144.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwetlick, H. (2005). Newton-Type Methods for Nonlinear Least Squares Using Restricted Second Order Information. In: Bock, H.G., Phu, H.X., Kostina, E., Rannacher, R. (eds) Modeling, Simulation and Optimization of Complex Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27170-8_34
Download citation
DOI: https://doi.org/10.1007/3-540-27170-8_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23027-4
Online ISBN: 978-3-540-27170-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)