Secant relations versus positive definiteness in quasi-Newton methods (Q790711)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Secant relations versus positive definiteness in quasi-Newton methods |
scientific article; zbMATH DE number 3848977
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Secant relations versus positive definiteness in quasi-Newton methods |
scientific article; zbMATH DE number 3848977 |
Statements
Secant relations versus positive definiteness in quasi-Newton methods (English)
0 references
1984
0 references
The effect of using a nonsymmetric and nonpositive-definite matrix for approximation of the Hessian inverse in unconstrained optimization is investigated. To this end, a new algorithm, which may be viewed as a member of the Huang family, is derived. The proposed algorithm possesses the quadratic termination property without exact line search. It seems from the numerical results that it is not essential to use a symmetric and positive-definite matrix.
0 references
quasi-Newton methods
0 references
nonsymmetric nonpositive-definite matrix
0 references
approximation of the Hessian inverse
0 references
unconstrained optimization
0 references
0 references
