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 条
  • [31] A Parallel Algorithm for Solving Large Convex Minimax Problems
    Arora, Ramnik
    Upadhyay, Utkarsh
    Tulshyan, Rupesh
    Dutta, J.
    SIMULATED EVOLUTION AND LEARNING, 2010, 6457 : 35 - +
  • [32] Inexact proximal penalty alternating linearization decomposition scheme of nonsmooth convex constrained optimization problems
    Lin, Si-Da
    Zhang, Ya-Jing
    Huang, Ming
    Yuan, Jin-Long
    Bei, Hong-Han
    APPLIED NUMERICAL MATHEMATICS, 2025, 211 : 42 - 60
  • [33] A proximal center-based decomposition method for multi-agent convex optimization
    Necoara, Ion
    Suykens, Johan A. K.
    47TH IEEE CONFERENCE ON DECISION AND CONTROL, 2008 (CDC 2008), 2008, : 3077 - 3082
  • [34] Solving quadratically constrained convex optimization problems with an interior-point method
    Meszaros, Csaba
    OPTIMIZATION METHODS & SOFTWARE, 2011, 26 (03): : 421 - 429
  • [35] An efficient improvement of the Newton method for solving non-convex optimization problems
    Niri, Tayebeh Dehghan
    Hosseini, Mohammad Mehdi
    Heydari, Mohammad
    COMPUTATIONAL METHODS FOR DIFFERENTIAL EQUATIONS, 2019, 7 (01): : 69 - 85
  • [36] Model decomposition based method for solving general dynamic optimization problems
    Huang, YJ
    Reklaitis, GV
    Venkatasubramanian, V
    COMPUTERS & CHEMICAL ENGINEERING, 2002, 26 (06) : 863 - 873
  • [37] Finding Good Starting Points for Solving Nonlinear Constrained Optimization Problems by Parallel Decomposition
    Lee, Soomin
    Wah, Benjamin
    MICAI 2008: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5317 : 65 - +
  • [38] A Unified Analysis of a Class of Proximal Bundle Methods for Solving Hybrid Convex Composite Optimization Problems br
    Liang, Jiaming
    Monteiro, Renato D. C.
    MATHEMATICS OF OPERATIONS RESEARCH, 2024, 49 (02) : 832 - 855
  • [39] A PROXIMAL ADMM WITH THE BROYDEN FAMILY FOR CONVEX OPTIMIZATION PROBLEMS
    Gu, Yan
    Yamashita, Nobuo
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2021, 17 (05) : 2715 - 2732
  • [40] Generalizations of the proximal method of multipliers in convex optimization
    R. Tyrrell Rockafellar
    Computational Optimization and Applications, 2024, 87 : 219 - 247
12345