Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization

Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization

0.00 Avg rating0 Votes
Article ID: iaor2013134
Volume: 54
Issue: 1
Start Page Number: 45
End Page Number: 64
Publication Date: Jan 2013
Journal: Computational Optimization and Applications
Authors: , ,
Keywords: programming: convex
Abstract:

By means of a gradient strategy, the Moreau‐Yosida regularization, limited memory BFGS update, and proximal method, we propose a trust‐region method for nonsmooth convex minimization. The search direction is the combination of the gradient direction and the trust‐region direction. The global convergence of this method is established under suitable conditions. Numerical results show that this method is competitive to other two methods.

Reviews

Required fields are marked *. Your email address will not be published.