期刊
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
卷 1, 期 2, 页码 171-180出版社
AMER INST MATHEMATICAL SCIENCES-AIMS
DOI: 10.3934/jimo.2005.1.171
关键词
nonsmooth convex optimization; Moreau-Yosida regularization; trust region method; BFGS method; strong convexity; inexact function and gradient evaluations
We propose an iterative method that solves a nonsmooth convex optimization problem by converting the original objective function to a once continuously differentiable function by way of Moreau-Yosida regularization. The proposed method makes use of approximate function and gradient values of the Moreau-Yosida regularization instead of the corresponding exact values. Under this setting, Fukushima and Qi (1996) and Rauf and Fukushima (2000) proposed a proximal Newton method and a proximal BFGS method, respectively, for nonsmooth convex optimization. While these methods employ a line search strategy to achieve global convergence, the method proposed in this paper uses a trust region strategy. We establish global and superlinear convergence of the method under appropriate assumptions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据