Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization (Q1760876): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q58907531, #quickstatements; #temporary_batch_1705750702424 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58907531 / rank | |||
Normal rank |
Revision as of 12:40, 20 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization |
scientific article |
Statements
Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization (English)
0 references
15 November 2012
0 references
Summary: We focus on developing diagonal gradient-type methods that employ accumulative approach in multistep diagonal updating to determine a better Hessian approximation in each step. The interpolating curve is used to derive a generalization of the weak secant equation, which will carry the information of the local Hessian. The new parameterization of the interpolating curve in variable space is obtained by utilizing accumulative approach via a norm weighting defined by two positive definite weighting matrices. We also note that the storage needed for all computation of the proposed method is just \(O(n)\). Numerical results show that the proposed algorithm is efficient and superior by comparison with some other gradient-type methods.
0 references
diagonal gradient-type methods
0 references
multistep diagonal updating
0 references