期刊
SIAM JOURNAL ON OPTIMIZATION
卷 22, 期 2, 页码 557-580出版社
SIAM PUBLICATIONS
DOI: 10.1137/100818327
关键词
nonsmooth convex minimization; smoothing methods; convex minimization; first order proximal gradients; rate of convergence; infimal convolution; asymptotic functions
We propose a unifying framework that combines smoothing approximation with fast first order algorithms for solving nonsmooth convex minimization problems. We prove that independently of the structure of the convex nonsmooth function involved, and of the given fast first order iterative scheme, it is always possible to improve the complexity rate and reach an O(epsilon(-1)) efficiency estimate by solving an adequately smoothed approximation counterpart. Our approach relies on the combination of the notion of smoothable functions that we introduce with a natural extension of the Moreau-infimal convolution technique along with its connection to the smoothing mechanism via asymptotic functions. This allows for clarification and unification of several issues on the design, analysis, and potential applications of smoothing methods when combined with fast first order algorithms.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据