On sparse and symmetric matrix updating subject to a linear equation

Author:
Ph. L. Toint

Journal:
Math. Comp. **31** (1977), 954-961

MSC:
Primary 65F30

MathSciNet review:
0455338

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A procedure for symmetric matrix updating subject to a linear equation and retaining any sparsity present in the original matrix is derived. The main feature of this procedure is the reduction of the problem to the solution of an *n* dimensional sparse system of linear equations. The matrix of this system is shown to be symmetric and positive definite. The method depends on the Frobenius matrix norm. Comments are made on the difficulties of extending the technique so that it uses more general norms, the main points being shown by a numerical example.

**[1]**C. G. Broyden,*A class of methods for solving nonlinear simultaneous equations*, Math. Comp.**19**(1965), 577–593. MR**0198670**, 10.1090/S0025-5718-1965-0198670-6**[2]**W. C. DAVIDON,*Variable Metric Method for Minimization*, Report #ANL-5990 (Rev.), A.N.L. Research and Development Report, 1959.**[3]**R. Fletcher and M. J. D. Powell,*A rapidly convergent descent method for minimization*, Comput. J.**6**(1963/1964), 163–168. MR**0152116****[4]**Donald Goldfarb,*A family of variable-metric methods derived by variational means*, Math. Comp.**24**(1970), 23–26. MR**0258249**, 10.1090/S0025-5718-1970-0258249-6**[5]**J. Greenstadt,*Variations on variable-metric methods. (With discussion)*, Math. Comp.**24**(1970), 1–22. MR**0258248**, 10.1090/S0025-5718-1970-0258248-4**[6]**H. Y. Huang,*Unified approach to quadratically convergent algorithms for function minimization*, J. Optimization Theory Appl.**5**(1970), 405–423. MR**0288939****[7]**M. J. D. Powell,*A new algorithm for unconstrained optimization*, Nonlinear Programming (Proc. Sympos., Univ. of Wisconsin, Madison, Wis., 1970) Academic Press, New York, 1970, pp. 31–65. MR**0272162****[8]**J. K. REID,*Two Fortran Subroutines for Direct Solution of Linear Equations Whose Matrix is Sparse, Symmetric and Positive Definite*, Report AERE-R. 7119, Harwell, 1972.**[9]**L. K. Schubert,*Modification of a quasi-Newton method for nonlinear equations with a sparse Jacobian*, Math. Comp.**24**(1970), 27–30. MR**0258276**, 10.1090/S0025-5718-1970-0258276-9

Retrieve articles in *Mathematics of Computation*
with MSC:
65F30

Retrieve articles in all journals with MSC: 65F30

Additional Information

DOI:
http://dx.doi.org/10.1090/S0025-5718-1977-0455338-4

Keywords:
Matrix updating,
quasi-Newton methods,
unconstrained optimization

Article copyright:
© Copyright 1977
American Mathematical Society