✦ LIBER ✦

The BFGS method with exact line searches fails for non-convex objective functions

✍ Scribed by Walter F. Mascarenhas

Book ID: 106275315
Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 259 KB
Volume: 99
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-003-0421-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A globally convergent BFGS method with n

A globally convergent BFGS method with nonmonotone line search for non-convex minimization

✍ Yunhai Xiao; Huijuan Sun; Zhiguo Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 626 KB

## a c t In this paper, we propose a modified BFGS (Broyden-Fletcher-Goldfarb-Shanno) method with nonmonotone line search for unconstrained optimization. Under some mild conditions, we show that the method is globally convergent without a convexity assumption on the objective function. We also repo

A note on “A globally convergent BFGS me

A note on “A globally convergent BFGS method with nonmonotone line search for non-convex minimization”

✍ Li Zhang; Xinlong Chen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Exact Minimization of Energy Functional

Exact Minimization of Energy Functional for NR Method With Line-Search Technique

✍ Okamoto, Y.; Fujiwara, K.; Himeno, R. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 461 KB

Global and Superlinear Convergence of a

Global and Superlinear Convergence of a Restricted Class of Self-Scaling Methods with Inexact Line Searches, for Convex Functions

✍ M. Al-Baali 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 256 KB

A gradient-only line search method for t

A gradient-only line search method for the conjugate gradient method applied to constrained optimization problems with severe noise in the objective function

✍ J. A. Snyman 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

A new implementation of the conjugate gradient method is presented that economically overcomes the problem of severe numerical noise superimposed on an otherwise smooth underlying objective function of a constrained optimization problem. This is done by the use of a novel gradient-only line search t