New BFGS method for unconstrained optimization problem based on modified Armijo line search
Access Status
Authors
Date
2012Type
Metadata
Show full item recordCitation
Source Title
ISSN
Collection
Abstract
In this article, a class of nonconvex unconstrained optimization problems is considered. As the Armijo line search is less costing in finding a steplength, a new Armijo-type line search (called WALS) with desirable features of the Wolfe condition is employed in the proposed modified BFGS method. A new updating formula incorporated with WALS is constructed and generates approximate Hessian matrices which are positive definite. On this basis, a class of well-defined modified BFGS algorithms is developed. It shows that under some suitable conditions, the modified BFGS algorithm is globally convergent. Numerical experiments are carried out on 20 benchmark test problems and the obtained results clearly indicate the effectiveness of the developed algorithm over two most popular BFGS-type algorithms available in the literature.
Related items
Showing items related by title, author, creator and subject.
-
Liu, J.; Zhang, S.; Wu, Changzhi; Liang, J.; Wang, Xiangyu; Teo, K. (2016)In this paper, we propose a novel hybrid global optimization method to solve constrained optimization problems. An exact penalty function is first applied to approximate the original constrained optimization problem by a ...
-
Liu, J.; Zhu, H.; Ma, Q.; Zhang, L.; Xu, Honglei (2015)Artificial Bee Colony (ABC) algorithm is a wildly used optimization algorithm. However, ABC is excellent in exploration but poor in exploitation. To improve the convergence performance of ABC and establish a better searching ...
-
Liu, X.; Sun, Jie (2004)We present a primal-dual interior-point algorithm for solving optimization problems with nonlinear inequality constraints. The algorithm has some of the theoretical properties of trust region methods, but works entirely ...