𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence of descent method with new line search

✍ Scribed by Zhen-Jun Shi; Jie Shen

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
230 KB
Volume
20
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The spherical quadratic steepest descent
The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches
✍ J.A. Snyman; A.M. Hay πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 481 KB

A very simple gradient only algorithm for unconstrained minimization is proposed that, in terms of storage requirement and computational efficiency, may be considered as an alternative to the conjugate gradient line search methods for large problems. The method effectively applies the steepest desce

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