Least change properties of ABS methods and their application in secant-type updates (Q4380562)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1129487
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Least change properties of ABS methods and their application in secant-type updates |
scientific article; zbMATH DE number 1129487 |
Statements
Least change properties of ABS methods and their application in secant-type updates (English)
0 references
15 October 1998
0 references
Broyden's updates
0 references
symmetric ABS method
0 references
matrix equations
0 references
secant-type updates
0 references
least change problems
0 references
weak secand updates
0 references
unconstrained optimization
0 references
0.7831470370292664
0 references
0.773329496383667
0 references
0.764482855796814
0 references
0.7638249397277832
0 references
The symmetric ABS method is considered for solving matrix equations. A feature of this method is that, for a given matrix equation, it provides a solution in closed form that has interesting least change properties. This result is exploited to establish secant-type updates by solving certain least change problems. Both \textit{C. G. Broyden's} updates for systems of nonlinear equations [Math. Comput. 19, 577-593 (1965; Zbl 0131.13905)] and the weak secand updates for unconstrained optimization by \textit{J. E. Dennis jun.} and \textit{H. Wlokowicz} [SIAM J. Numer. Anal. 30, No. 5, 1291-1314 (1993; Zbl 0802.65081)] are extended to the multiple case.
0 references
