## 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
β¦ LIBER β¦
Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
β Scribed by Qiang Guo; Jian-Guo Liu
- Publisher
- Springer-Verlag
- Year
- 2007
- Tongue
- English
- Weight
- 191 KB
- Volume
- 24
- Category
- Article
- ISSN
- 1598-5865
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A globally convergent BFGS method with n
β
Yunhai Xiao; Huijuan Sun; Zhiguo Wang
π
Article
π
2009
π
Elsevier Science
π
English
β 626 KB
Global convergence of the nonmonotone MB
β
Weijun Zhou; Li Zhang
π
Article
π
2009
π
Elsevier Science
π
English
β 404 KB
In this paper, we propose a new nonmonotone Armijo type line search and prove that the MBFGS method proposed by Li and Fukushima with this new line search converges globally for nonconvex minimization. Some numerical experiments show that this nonmonotone MBFGS method is efficient for the given test
A globally convergent Newton method for
β
J. S. Pang; L. Qi
π
Article
π
1995
π
Springer
π
English
β 696 KB
Global Convergence of a Modified Gradien
β
Qing-ying Sun; Chang-yu Wang; Zhen-jun Shi
π
Article
π
2006
π
Institute of Applied Mathematics, Chinese Academy
π
English
β 229 KB
Global convergence of a modified Fletche
β
Li Zhang; Weijun Zhou; Donghui Li
π
Article
π
2006
π
Springer-Verlag
π
English
β 178 KB
Use of a finite penalty in convex progra
β
V. M. Panin
π
Article
π
1983
π
Springer US
π
English
β 430 KB