Abstract
This paper is devoted to globally convergent methods for solving large sparse systems of nonlinear equations with an inexact approximation of the Jacobian matrix. These methods include difference versions of the Newton method and various quasi-Newton methods. We propose a class of trust region methods together with a proof of their global convergence and describe an implementable globally convergent algorithm which can be used as a realization of these methods. Considerable attention is concentrated on the application of conjugate gradient-type iterative methods to the solution of linear subproblems. We prove that both the GMRES and the smoothed COS well-preconditioned methods can be used for the construction of globally convergent trust region methods. The efficiency of our algorithm is demonstrated computationally by using a large collection of sparse test problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
BROWN, P. N., and SAAD, Y., Hybrid Krylov Methods for Nonlinear Systems of Equations, SIAM Journal on Scientific and Statistical Computing, Vol. 11, pp. 450–481, 1990.
BROWN, P. N., and SAAD, Y., Convergence Theory of Nonlinear Newton-Krylov Algorithms, SIAM Journal on Optimization, Vol. 4, pp. 297–330, 1994.
DENNIS, J. E., and SCHNABEL, R. B., Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, New Jersey, 1983.
EISENSTAT, S. C., and WALKER, H. F., Globally Convergent Inexact Newton Methods, SIAM Journal on Optimization, Vol. 4, pp. 393–422, 1994.
KELLEY, C. T., Iterative Methods for Linear and Nonlinear Equations, SIAM, Philadelphia, Pennsylvania, 1995.
POWELL, M. J. D., On the Global Convergence of Trust Region Algorithms for Unconstrained Minimization, Mathematical Programming, Vol. 29, pp. 297–303, 1984.
COLEMAN, T. F., GARBOW, B. S., and MORÉ, J. S., Software for Estimating Sparse Jacobian Matrices, ACM Transactions on Mathematical Software, Vol. 10, pp. 329–345, 1984.
SAAD, Y., and SCHULTZ, M., GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems, SIAM Journal on Scientific and Statistical Computing, Vol. 7, pp. 856–869, 1986.
TONG, C. H., A Comparative Study of Preconditioned Lanczos Methods for Nonsymmetric Linear Systems, Sandia Report SAND91–8240B, Sandia National Laboratories, Albuquerque, New Mexico, 1992.
SONNEVELD, P., CGS: A Fast Lanczos-Type Solver for Nonsymmetric Linear Systems, SIAM Journal on Scientific and Statistical Computing, Vol. 10, pp. 36–52, 1989.
STEIHAUG, T., The Conjugate Gradient Method and Trust Regions in Large-Scale Optimization, SIAM Journal on Numerical Analysis, Vol. 20, pp. 626–637, 1983.
SCHUBERT, L. K., Modification of a Quasi-Newton Method for Nonlinear Equations with Sparse Jacobian, Mathematics of Computation, Vol. 24, pp. 27–30, 1970.
LUKŠAN, L., ŠIŠKA, M., TŮMA, M., VLČEK, J., and RAMEŠOVÁ, N., Interactive System for Universal Functional Optimization (UFO): Version 1995, Research Report V-662, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Czech Republic, 1995.
LUKŠAN, L., Inexact Trust Region Method for Large Sparse Systems of Nonlinear Equations, Journal of Optimization Theory and Applications, Vol. 81, pp. 569–590, 1994.
DAVIS, T. A., User's Guide for the Unsymmetric-Pattern Multifrontal Package (UMFPACK), Research Report TR–93–020, Computer and Information Sciences Department, University of Florida, Gainesville, Florida, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lukšan, L., Vlček, J. Truncated Trust Region Methods Based on Preconditioned Iterative Subalgorithms for Large Sparse Systems of Nonlinear Equations. Journal of Optimization Theory and Applications 95, 637–658 (1997). https://doi.org/10.1023/A:1022678023392
Issue Date:
DOI: https://doi.org/10.1023/A:1022678023392