TY - JOUR
T1 - A Modified BFGS Formula Maintaining Positive Definiteness with Armijo-Goldstein Steplengths
AU - I. D. Coope & C. J. Price
JO - Journal of Computational Mathematics
VL - 2
SP - 156
EP - 160
PY - 1995
DA - 1995/04
SN - 13
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/9258.html
KW - 
AB - <p style="text-align: justify;">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.</p>