Share:


The Barzilai and Borwein gradient method with nonmonotone line search for nonsmooth convex optimization problems

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.

Keyword : nonsmooth convex minimization, spectral gradient, nonmonotone technique, global convergence

How to Cite
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
Published in Issue
Apr 1, 2012
Abstract Views
15
PDF Downloads
10
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.