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

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

Blog Article

The Barzilai and Borwein gradient algorithm has received a great deal of attention in recent decades since it Dinnerware Sets 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 girls tee 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.