New Quasi-Newton Equation and Related Methods for Unconstrained Optimization
J. Z. Zhang,
N. Y. Deng and
L. H. Chen
Journal of Optimization Theory and Applications, 1999, vol. 102, issue 1, No 10, 147-167
Abstract:
Abstract In unconstrained optimization, the usual quasi-Newton equation is B k+1 s k=y k, where y k is the difference of the gradients at the last two iterates. In this paper, we propose a new quasi-Newton equation, $$B_{k + 1} s_k = \tilde y_k $$ , in which $$\tilde y_k $$ is based on both the function values and gradients at the last two iterates. The new equation is superior to the old equation in the sense that $$\tilde y_k $$ better approximates ∇ 2 f(x k+1)s k than y k. Modified quasi-Newton methods based on the new quasi-Newton equation are locally and superlinearly convergent. Extensive numerical experiments have been conducted which show that the new quasi-Newton methods are encouraging.
Keywords: Unconstrained optimization; quasi-Newton equations; quasi-Newton methods (search for similar items in EconPapers)
Date: 1999
References: View complete reference list from CitEc
Citations: View citations in EconPapers (21)
Downloads: (external link)
http://link.springer.com/10.1023/A:1021898630001 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:102:y:1999:i:1:d:10.1023_a:1021898630001
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1023/A:1021898630001
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().