On the Parallel Proximal Decomposition Method for Solving the Problems of Convex Optimization

被引：9
|
作者：
Semenov, V. V. [1 ]
机构：
[1] Kiev Natl Taras Shevchenko Univ, Kiev, Ukraine
来源：
JOURNAL OF AUTOMATION AND INFORMATION SCIENCES | 2010年 / 42卷 / 04期
关键词：
convex optimization; parallel proximal decomposition; parallel computer systems; parallel decomposition algorithm; parallel processing; MONOTONE-OPERATORS; CONVERGENCE; ALGORITHMS; SUM;
D O I：
10.1615/JAutomatInfScien.v42.i4.20
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The parallel proximal decomposition algorithm for solving the problem of convex minimization in the Hilbert space is studied. The theorem on weak convergence of Cesaro averages of the sequence generated by the algorithm is proved.
引用
收藏
页码：13 / 18
页数：6
相关论文
共 50 条
12345