Abstract
The Barzilai and Borwein gradient algorithm has received a great deal of attention in recent decades since it is simple and effective for smooth optimization problems. Whether can it be extended to solve nonsmooth problems? In this paper, we answer this question positively. The Barzilai and Borwein gradient algorithm combined with a nonmonotone line search technique is proposed for nonsmooth convex minimization. The global convergence of the given algorithm is established under suitable conditions. Numerical results show that this method is efficient. © 2012 Copyright Vilnius Gediminas Technical University.
Author supplied keywords
Cite
CITATION STYLE
Yuan, G., & Wei, Z. (2012). The Barzilai and Borwein Gradient Method with Nonmonotone Line Search for Nonsmooth Convex Optimization Problems. Mathematical Modelling and Analysis, 17(2), 203–216. https://doi.org/10.3846/13926292.2012.661375
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.