A memory gradient method for non-smooth convex optimization

作者：Ou, Yigui^*; Liu, Yuanwen

来源：International Journal of Computer Mathematics, 2015, 92(8): 1625-1642.

DOI：10.1080/00207160.2014.955483

• TRUST REGION ALGORITHM
• UNCONSTRAINED OPTIMIZATION
• MINIMIZATION
• CONVERGENCE

Based on the Moreau-Yosida regularization and a modified line search technique, this paper presents an implementable memory gradient method for solving a possibly non-differentiable convex minimization problem by converting the original objective function to a once continuously differentiable function. A main feature of this proposed method is that at each iteration, it sufficiently uses the previous multi-step iterative information and avoids the storage and computation of some matrices. Moreover, the proposed method makes use of approximate function and gradient values of the Moreau-Yosida regularization instead of the corresponding exact values. Under reasonable conditions, the convergence properties of the proposed algorithm are analysed. Preliminary numerical results show that the proposed method is efficient and can be applied to solve large-scale non-smooth optimization problems.

• 出版日期2015-8-3
• 单位海南大学