A memory gradient method for non-smooth convex optimization

References

• A. Auslender, Numerical methods for nondifferentiable convex optimization, Math. Program. Study 30 (1987), pp. 102–126.
   Web of Science ®Google Scholar
• J.F. Bonnans, J.C. Gilbert, C. Lemarechal, and C. Sagastizabal, A family of variable-metric proximal methods, Math. Program. 68 (1995), pp. 15–47.
   Web of Science ®Google Scholar
• J.V. Burke and M. Qian, On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGF matrix secant updating, Math. Program. 88 (2000), pp. 157–181.
   Web of Science ®Google Scholar
• X. Chen and M. Fukushima, Proximal quasi-Newton methods for nondifferentiable convex optimization, Math. Program. 85 (1999), pp. 313–334.
   Web of Science ®Google Scholar
• Y.H. Dai and Y.X. Yuan, Nonlinear Conjugate Gradient Methods (in Chinese), Shanghai Scientific and Technical Publishers, Shanghai, 2000.
   Google Scholar
• M. Fukushima and L.Q. Qi, A globally and superlinearly convergent algorithm for nonsmooth convex minimization, SIAM J. Optim. 4 (1996), pp. 1106–1120.
   Web of Science ®Google Scholar
• 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.
   Web of Science ®Google Scholar
• M. Haarala, K. Miettinen, and M.M. Mäkelä, New limited memory bundle method for large-scale nonsmooth optimization, Optim. Methods Softw. 19 (2004), pp. 673–692.
   Web of Science ®Google Scholar
• W.W. Hager and H.C. Zhang, A survey of nonlinear conjugate gradient methods, Pac. J. Optim. 2 (2006), pp. 35–58.
   Google Scholar
• J.B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, Springer, Berlin, 1993.
   Google Scholar
• C. Lemarechal and C. Sagastizabal, Practical aspects of the Moreau–Yosida regularization, I: Theoretical preliminaries, SIAM J. Optim. 7 (1997), pp. 367–385.
   Web of Science ®Google Scholar
• Q. Li, Conjugate gradient type methods for the nondifferentiable convex minimization, Optim. Lett. 7 (2013), pp. 533–545.
   Web of Science ®Google Scholar
• S. Lu, Z.X. Wei, and L. Li, A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization, Comput. Optim. Appl. 51 (2012), pp. 551–573.
   Web of Science ®Google Scholar
• R. Mifflin, A quasi-second-order proximal bundle algorithm, Math. Program. 73 (1996), pp. 51–72.
   Web of Science ®Google Scholar
• Y. Narushima and H. Yabe, Global convergence of a memory gradient method for unconstrained optimization, Comput. Optim. Appl. 35 (2006), pp. 325–346.
   Google Scholar
• J.M. Ortega and W.C. Rheinboldt, Iterative Solutions of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
   Google Scholar
• Y.G. Ou and Y.W. Liu, A nonmonotone supermemory gradient algorithm for unconstrained optimization, J. Appl. Math. Comput.. Published online 2013, doi:10.1007/s12190-013-0747-0.
   Google Scholar
• A.I. Rauf and M. Fukushima, A globally convergent BFGS method for nonsmooth convex optimization, J. Optim. Theory Appl. 104 (2000), pp. 539–558.
   Web of Science ®Google Scholar
• N. Sagara and M. Fukushima, A trust region method for nonsmooth convex optimization, J. Ind. Manag. Optim. 1 (2005), pp. 171–180.
   Web of Science ®Google Scholar
• J. Shen, L.P. Pang, and D. Li, An approximate quasi-Newton bundle-type method for nonsmooth optimization, Abstr. Appl. Anal.. Published online 2013, doi:10.1155/2013/697474.
   Web of Science ®Google Scholar
• Z.J. Shi and J. Shen, A gradient-related algorithm with inexact line searches, J. Comput. Appl. Math. 170 (2004), pp. 349–370.
   Web of Science ®Google Scholar
• Z.J. Shi and J. Shen, A new supermemory gradient method with curve search rule, Appl. Math. Comput. 170 (2005), pp. 1–16.
   Web of Science ®Google Scholar
• Z.J. Shi and J. Shen, On memory gradient method with trust region for unconstrained optimization, Numer. Algorithms 41 (2006), pp. 173–196.
   Web of Science ®Google Scholar
• G.L. Yuan, Z.X. Wei, and Z.X. Wang, Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minization, Comput. Optim. Appl. 54 (2013), pp. 45–64.
   Web of Science ®Google Scholar
• G.L. Yuan, Z.X. Wei, and G.Y. Li, A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs, J. Comput. Appl. Math. 255 (2014), pp. 86–96.
   Web of Science ®Google Scholar
• L.P. Zhang, A new trust region algorithm for nonsmooth convex minimization, Appl. Math. Comput. 193 (2007), pp. 135–142.
   Web of Science ®Google Scholar
• 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.
   Web of Science ®Google Scholar
• Y. Zheng and Z.P. Wan, A new variant of the memory gradient method for unconstrained optimization, Optim. Lett. 6 (2012), pp. 1643–1655.
   Web of Science ®Google Scholar