Quasi-Newton Updates with Bounds
Authors:
- Paul H. CalamaiPCPaul H. Calamai
- Jorge J. MoréJMJorge J. Moré
- 1 December 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 24 (6) , 1434-1441
Abstract
We develop a quasi-Newton method which preserves known bounds on the Jacobian matrix. We show that this update can be computed with the same amount of work as competitive methods. In particular, we prove that the number of operations required to obtain this update is proportional to the number of nonzeros in the sparsity pattern of the Jacobian matrix. The method is also shown to share the local convergence properties of Broyden’s and Schubert’s method.Keywords
This publication has 12 references indexed in Scilit:
- Orthogonal Projections on Convex Sets for Newton-Like MethodsSIAM Journal on Numerical Analysis, 1985
- Convergence Theorems for Least-Change Secant Update MethodsSIAM Journal on Numerical Analysis, 1981
- Convergence Results for Schubert’s Method for Solving Sparse Nonlinear EquationsSIAM Journal on Numerical Analysis, 1979
- Update Methods for Highly Structured Systems of Nonlinear EquationsSIAM Journal on Numerical Analysis, 1979
- On the convergence of a quasi-Newton method for sparse nonlinear systemsMathematics of Computation, 1978
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977
- On the Global Convergence of Broyden's MethodMathematics of Computation, 1976
- A New Algorithm for Unconstrained Optimization1970
- Modification of a quasi-Newton method for nonlinear equations with a sparse JacobianMathematics of Computation, 1970
- A class of methods for solving nonlinear simultaneous equationsMathematics of Computation, 1965