Year: 1995
Journal of Computational Mathematics, Vol. 13 (1995), Iss. 2 : pp. 156–160
Abstract
The line search subproblem in unconstrained optimization is concerned with finding an acceptable steplength satisfying certain standard conditions. The conditions proposed in the early work of Armijo and Goldstein are sometimes replaced by those recommended by Wolfe because these latter conditions automatically allow positive definiteness of some popular quasi-Newton updates to be maintained. It is shown that a slightly modified form of quasi-Newton update allows positive definiteness to be maintained even if line searches based on the Armijo-Goldstein conditions are used.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1995-JCM-9258
Journal of Computational Mathematics, Vol. 13 (1995), Iss. 2 : pp. 156–160
Published online: 1995-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 5