期刊
OPTIMIZATION
卷 70, 期 5-6, 页码 1307-1336出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2020.1846188
关键词
Convex optimization; Fenchel conjugate; incremental proximal method; penalization; proximal gradient algorithm
资金
- Thailand Research Fund [RAP61K0012]
The study introduces an algorithm combining the incremental proximal gradient method with smooth penalization technique for minimizing a finite sum of convex functions subject to the set of minimizers of a convex differentiable function. The convergence of the algorithm is proven, and its effectiveness is demonstrated through numerical experiments.
We consider the problem of minimizing a finite sum of convex functions subject to the set of minimizers of a convex differentiable function. In order to solve the problem, an algorithm combining the incremental proximal gradient method with smooth penalization technique is proposed. We show the convergence of the generated sequence of iterates to an optimal solution of the optimization problems, provided that a condition expressed via the Fenchel conjugate of the constraint function is fulfilled. Finally, the functionality of the method is illustrated by some numerical experiments addressing image inpainting problems and generalized Heron problems with least squares constraints.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据