A limited memory quasi-Newton trust-region method for box constrained optimization

被引:9
|
作者
Rahpeymaii, Farzad [1 ]
Kimiaei, Morteza [2 ]
Bagheri, Alireza [3 ]
机构
[1] Payame Noor Univ, Dept Math, POB 19395-3697, Tehran, Iran
[2] Islamic Azad Univ, Asadabad Branch, Dept Math, Asadabad, Iran
[3] Islamic Azad Univ, Asadabad Branch, Dept Comp Engn, Asadabad, Iran
关键词
Constrained optimization; Limited memory quasi-Newton; Line-search; Wolfe conditions; Trust-region framework; Theoretical convergence; GLOBAL CONVERGENCE; SIMPLE BOUNDS; BFGS METHOD; MATRICES; ALGORITHM; MINIMIZATION; STORAGE;
D O I
10.1016/j.cam.2016.02.026
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
By means of Wolfe conditions strategy, we propose a quasi-Newton trust-region method to solve box constrained optimization problems. This method is an adequate combination of the compact limited memory BFGS and the trust-region direction while the generated point satisfies the Wolfe conditions and therefore maintains a positive-definite approximation to the Hessian of the objective function. The global convergence and the quadratic convergence of this method are established under suitable conditions. Finally, we compare our algorithms (IWTRAL and IBWTRAL) with an active set trust-region algorithm (ASTRAL) Xu and Burke (2007) on the CUTEst box constrained test problems presented by Gould et al. (2015). Numerical results show that the presented method is competitive and totally interesting for solving box constrained optimization. (C) 2016 Elsevier B.V. All rights reserved.
引用
下载
收藏
页码:105 / 118
页数:14
相关论文
共 50 条