239
Views
2
CrossRef citations to date
0
Altmetric
Articles

A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization

&
Pages 2212-2228 | Received 16 Nov 2016, Accepted 26 Jun 2017, Published online: 31 Aug 2017

References

  • N. Andrei, Scaled conjugate gradient algorithms for unconstrained optimization, Comput. Optim. Appl. 38 (2007), pp. 401–416. doi: 10.1007/s10589-007-9055-7
  • N. Andrei, Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization, Eur. J. Oper. Res. 204 (2010), pp. 410–420. doi: 10.1016/j.ejor.2009.11.030
  • L. Armijo, Minimization of functions having Lipschitz continuous first partial derivatives, Pac. J. Math. 16 (1966), pp. 1–3. doi: 10.2140/pjm.1966.16.1
  • F. Arzani and M. Reza Peyghami, A new nonmonotone filter Barzilai-Borwein method for solving unconstrained minimization problems, Int. J. Comput. Math. 93 (2016), pp. 596–608. doi: 10.1080/00207160.2015.1009903
  • S. Babaie-Kafaki, A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization, 4OR, Q. J. Oper. Res. 11 (2013), pp. 361–374. doi: 10.1007/s10288-013-0233-4
  • J. Barzilai and J.M. Borwein, Two-point step size gradient methods, IMA J. Numer. Anal. 8 (1988), pp. 141–148. doi: 10.1093/imanum/8.1.141
  • D.P. Bertsekas, Constrained Optimization and Lagrange Multipier Methods, Academic Press, New York, 1982.
  • E.G. Birgin and J.M. Martínez, A spectral conjugate gradient method for unconstrained optimization, Appl. Math. Optim. 43 (2001), pp. 117–128. doi: 10.1007/s00245-001-0003-0
  • I. Bongartz, A.R. Conn, N.I.M. Gould, and P.L. Toint, CUTE: Constrained and unconstrained testing environments, ACM Trans. Math. Softw. 21 (1995), pp. 123–160. doi: 10.1145/200979.201043
  • Y.H. Dai, On the nonmonotone line search, J. Optim. Theory. Appl. 112 (2002), pp. 315–330. doi: 10.1023/A:1013653923062
  • Y.H. Dai and C.X. Kou, A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search, SIAM J. Optim. 23 (2013), pp. 296–320. doi: 10.1137/100813026
  • Y.H. Dai and Y.X. Yuan, Nonlinear Conjugate Gradient Methods (in Chinese), Shanghai Scientific and Technical Publishers, Shanghai, 2000.
  • N.Y. Deng, Y. Xiao, and F.J. Zhou, Nonmonotonic trust region algorithm, J. Optim. Theory. Appl. 76 (1993), pp. 259–285. doi: 10.1007/BF00939608
  • E.D. Dolan and J.J. More, Benchmarking optimization software with performance profiles, Math. Progr. Ser. A 91 (2002), pp. 201–213. doi: 10.1007/s101070100263
  • B. Fan, A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems, J. Comput. Appl. Math. 290 (2015), pp. 641–655. doi: 10.1016/j.cam.2015.06.022
  • L. Grippo, F. Lampariello, and S. Lucidi, A nonmonotone line search technique for Newton's method, SIAM. J. Numer. Anal. 23 (1986), pp. 707–716. doi: 10.1137/0723046
  • N.-Z. Gu and J.-T. Mo, Incorporating nonmonotone strategies into the trust region method for unconstrained optimization, Comput. Math. Appl. 55 (2008), pp. 2158–2172. doi: 10.1016/j.camwa.2007.08.038
  • W.W. Hager and H.C. Zhang, A survey of nonlinear conjugate gradient methods, Pac. J. Optim. 2 (2006), pp. 35–58.
  • W.W. Hager and H.C. Zhang, Algorithm 851: CG-Descent, a conjugate gradient method with guaranteed descent, ACM Trans. Math. Softw. 32 (2006), pp. 113–137. doi: 10.1145/1132973.1132979
  • D.H. Li and M. Fukushima, A modified BFGS method and its global convergence in nonconvex minimization, J. Comput. Appl. Math. 129 (2001), pp. 15–35. doi: 10.1016/S0377-0427(00)00540-9
  • J. Nocedal and S.J. Wright, Numerical Optimization, Springer, New York, 2006.
  • Y.G. Ou and Q. Zhou, A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming, Appl. Math. Comput. 215 (2009), pp. 474–480.
  • D.F. Shanno, On the convergence of a new conjugate gradient algorithm, SIAM. J. Numer. Anal. 15 (1978), pp. 1247–1257. doi: 10.1137/0715085
  • Z.J. Shi, S.Q. Wang, and Z.W. Xu, The convergence of conjugate gradient method with nonmonotone line search, Appl. Math. Comput. 217 (2010), pp. 1921–1932.
  • W.Y. Sun and Y.X. Yuan, Optimization Theory and Methods: Nonlinear Programming, Springer Optimization and Its Applications, Vol. 1, Springer, New York, 2006.
  • W.-Y. Sun and Q.-Y. Zhou, An unconstrained optimization method using nonmonotone second order Goldstein's linesearch, Sci. China (Ser. A): Math. 50 (2007), pp. 1389–1400. doi: 10.1007/s11425-007-0072-x
  • Ph.L. Toint, An assessment of nonmonotone line search techniques for unconstrained optimization, SIAM J. Sci. Stat. Comput. 17 (1996), pp. 725–739. doi: 10.1137/S106482759427021X
  • H. Wang and D.G. Pu, A nonmonotone filter trust region method for the system of nonlinear equations, Appl. Math. Model. 37 (2013), pp. 498–506. doi: 10.1016/j.apm.2012.03.005
  • Z.X. Wei, G.Y. Li, and L.Q. Li, New quasi-Newton methods for unconstrained optimization problems, Appl. Math. Comput. 175 (2006), pp. 1156–1188.
  • Y.-X. Yuan, A modified BFGS algorithm for unconstrained optimization, IMA J. Numer. Anal. 11 (1991), pp. 325–332. doi: 10.1093/imanum/11.3.325
  • H.C. Zhang and W.W. Hager, A nonmonotone line search technique and its application to unconstrained optimization, SIAM J. Optim. 14 (2004), pp. 1043–1056. doi: 10.1137/S1052623403428208
  • J.Z. Zhang, N.Y. Deng, and L.H. Chen, New quasi-Newton equation and related methods for unconstrained optimization, J. Optim. Theory. Appl. 102 (1999), pp. 737–747. doi: 10.1023/A:1021898630001
  • W.J. Zhou and L. Zhang, Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization, J. Comput. Appl. Math. 223 (2009), pp. 40–47. doi: 10.1016/j.cam.2007.12.011

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.