122
Views
7
CrossRef citations to date
0
Altmetric
Original Article

A hybrid scaling parameter for the scaled memoryless BFGS method based on the ℓ matrix norm

Pages 1595-1602 | Received 13 Jan 2017, Accepted 11 Apr 2018, Published online: 16 May 2018

References

  • N. Andrei, Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization, European J. Oper. Res. 204(3) (2010), pp. 410–420. doi: 10.1016/j.ejor.2009.11.030
  • N. Andrei, Open problems in conjugate gradient algorithms for unconstrained optimization, Bull. Malays. Math. Sci. Soc. 34(2) (2011), pp. 319–330.
  • S. Babaie-Kafaki, A quadratic hybridization of Polak–Ribière–Polyak and Fletcher–Reeves conjugate gradient methods, J. Optim. Theory Appl. 154(3) (2012), pp. 916–932. doi: 10.1007/s10957-012-0016-7
  • S. Babaie-Kafaki, A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization, 4OR 11(4) (2013), pp. 361–374. doi: 10.1007/s10288-013-0233-4
  • S. Babaie-Kafaki, On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae, J.Optim. Theory Appl. 167(1) (2015), pp. 91–101. doi: 10.1007/s10957-015-0724-x
  • S. Babaie-Kafaki, A modified scaling parameter for the memoryless BFGS updating formula, Numer. Algorithms 72(2) (2016), pp. 425–433. doi: 10.1007/s11075-015-0053-z
  • E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles, Math. Program. 91(2,Ser. A) (2002), pp. 201–213. doi: 10.1007/s101070100263
  • N.I.M. Gould, D. Orban, and Ph.L. Toint, CUTEr: A constrained and unconstrained testing environment, revisited, ACM Trans. Math. Softw. 29(4) (2003), pp. 373–394. doi: 10.1145/962437.962439
  • J. Nocedal and S.J. Wright, Numerical Optimization, Springer, New York, 2006.
  • S.S. Oren, Self-scaling variable metric (SSVM) algorithms. II. Implementation and experiments, Manage. Sci. 20(5) (1974), pp. 863–874. doi: 10.1287/mnsc.20.5.863
  • S.S. Oren and D.G. Luenberger, Self-scaling variable metric (SSVM) algorithms. I. Criteria and sufficient conditions for scaling a class of algorithms, Manage. Sci. 20(5) (1973), pp. 845–862. doi: 10.1287/mnsc.20.5.845
  • S.S. Oren and E. Spedicato, Optimal conditioning of self-scaling variable metric algorithms, Math. Program. 10(1) (1976), pp. 70–90. doi: 10.1007/BF01580654
  • W. Sun and Y.X. Yuan, Optimization Theory and Methods: Nonlinear Programming, Springer, New York, 2006.
  • D.S. Watkins, Fundamentals of Matrix Computations, John Wiley and Sons, New York, 2002.
  • G. Yuan and Z. Wei, Convergence analysis of a modified BFGS method on convex minimizations, Comput. Optim. Appl. 47(2) (2010), pp. 237–255. doi: 10.1007/s10589-008-9219-0
  • G. Yuan, Z. Wei, and Z. Wang, Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization, Comput. Optim. Appl. 54(1) (2013), pp. 45–64. doi: 10.1007/s10589-012-9485-8
  • G. Yuan, Z. Wei, and X. Lu, Global convergence of BFGS and PRP methods under a modified weak Wolfe–Powell line search, Appl. Math. Model. (2017). doi: 10.1016/j.apm.2017.02.008.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.