Abstract.
This work shows that the BFGS method and other methods in the Broyden class, with exact line searches, may fail for non-convex objective functions.
Similar content being viewed by others
References
Yu-Hong, D.: Convergence properties of the BFGS Algorithm. SIAM J. Optim 13(3), 693–701 (2002)
Dixon, L.C.W.: Quasi-Newton Algorithms Generate Identical Points. Math. Program. 2, 383–387 (1972)
Fletcher, R., Powell, M.J.D.: A rapidly convergent descent method for minimization. Comput. J. 6, 163–168 (1963)
Hörmander, L.: The Analysis of Linear Partial Differential Operators I, Springer Verlag, 1983
Li, D., Fukushima, M.: On the Global Convergence of BFGS Method for Nonconvex Unconstrained Optimization. SIAM J. Optim. 11(4), 1054–1064 (2001)
Nocedal, J.: Theory of algorithms for unconstrained optimization. Acta Numerica 199–242 (1992)
Powell, M.J.D.: Nonconvex minimization calculations and the conjugate gradient method. In: D.F. Griffiths, ed., Numerical Analysis, Lecture Notes in Mathematics 1066, Springer Verlag, Berlin, 1984 pp. 122–141
Powell, M.J.D.: On the convergence of the DFP Algorithm for unconstrained optimization when there are only two variables. Math. Program. Ser. B. 87, 281–301 (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mascarenhas, W. The BFGS method with exact line searches fails for non-convex objective functions. Math. Program., Ser. A 99, 49–61 (2004). https://doi.org/10.1007/s10107-003-0421-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-003-0421-7