A combined class of self-scaling and modified quasi-Newton methods

被引:0
作者
Mehiddin Al-Baali
Humaid Khalfan
机构
[1] Sultan Qaboos University,Department of Mathematics and Statistics
[2] UAE University,Department of Mathematics and Computer Science
来源
Computational Optimization and Applications | 2012年 / 52卷
关键词
Unconstrained optimization; Modified quasi-Newton updates; Self-scaling technique; Line-search framework;
D O I
暂无
中图分类号
学科分类号
摘要
Techniques for obtaining safely positive definite Hessian approximations with self-scaling and modified quasi-Newton updates are combined to obtain ‘better’ curvature approximations in line search methods for unconstrained optimization. It is shown that this class of methods, like the BFGS method, has the global and superlinear convergence for convex functions. Numerical experiments with this class, using the well-known quasi-Newton BFGS, DFP and a modified SR1 updates, are presented to illustrate some advantages of the new techniques. These experiments show that the performance of several combined methods are substantially better than that of the standard BFGS method. Similar improvements are also obtained if the simple sufficient function reduction condition on the steplength is used instead of the strong Wolfe conditions.
引用
收藏
页码:393 / 408
页数:15
相关论文
共 58 条
  • [1] Al-Baali M.(1993)Variational quasi-Newton methods for unconstrained optimization J. Optim. Theory Appl. 77 127-143
  • [2] Al-Baali M.(1998)Global and superlinear convergence of a restricted class of self-scaling methods with inexact line searches for convex functions Comput. Optim. Appl. 9 191-203
  • [3] Al-Baali M.(2009)On practical modifications of the quasi-Newton BFGS method Adv. Model. Optim. 11 63-76
  • [4] Grandinetti L.(2005)A wide interval for efficient self-scaling quasi-Newton algorithms Optim. Methods Softw. 20 679-691
  • [5] Al-Baali M.(1987)Global convergence of a class of quasi-Newton methods on convex problems SIAM J. Numer. Anal. 24 1171-1190
  • [6] Khalfan H.(1992)On the behavior of Broyden’s class of quasi-Newton methods SIAM J. Optim. 2 533-557
  • [7] Byrd R.H.(1988)Testing a class of algorithms for solving minimization problems with simple bound on the variables Math. Comput. 50 399-430
  • [8] Nocedal J.(2002)Benchmarking optimization software with performance profiles Math. Program. 91 201-213
  • [9] Yuan Y.(1963)A rapidly convergent descent method for minimization Comput. J. 6 163-168
  • [10] Byrd R.H.(2003)Limited-memory reduced-Hessian methods for large-scale unconstrained optimization SIAM J. Optim. 14 380-401