Distributed algorithms for solving the convex feasibility problems

被引：0
|
作者：
Kaihong LU [1 ]
Gangshan JING [1 ,2 ]
Long WANG [3 ]
机构：
[1] Center for Complex Systems,School of Mechano-electronic Engineering,Xidian University
[2] Department of Applied Mathematics,Hong Kong Polytechnic University
[3] Center for Systems and Control,College of Engineering,Peking University
来源：
Science China(Information Sciences) | 2020年 / 63卷 / 08期
基金：
中国国家自然科学基金;
关键词：
D O I：
暂无
中图分类号：
O157.5 [图论]; O224 [最优化的数学理论];
学科分类号：
070104 ; 070105 ; 1201 ;
摘要：
Dear editor,Along with the recent adoption of multi-agent networks [1–9], consensus-based distributed optimization has been extensively investigated. In [1], a distributed algorithm that combines the consensus and subgradient algorithms was developed for obtaining the solution of the unconstrained convex distributed optimization problems. In [2], a distributed discrete-time projected subgradient al-
引用
收藏
页码：242 / 244
页数：3
相关论文
共 50 条
  • [1] Distributed algorithms for solving the convex feasibility problems
    Kaihong Lu
    Gangshan Jing
    Long Wang
    [J]. Science China Information Sciences, 2020, 63
  • [2] Distributed algorithms for solving the convex feasibility problems
    Lu, Kaihong
    Jing, Gangshan
    Wang, Long
    [J]. SCIENCE CHINA-INFORMATION SCIENCES, 2020, 63 (08)
  • [3] Projection algorithms for solving convex feasibility problems
    Bauschke, HH
    Borwein, JM
    [J]. SIAM REVIEW, 1996, 38 (03) : 367 - 426
  • [4] An Acceleration Scheme for Solving Convex Feasibility Problems Using Incomplete Projection Algorithms
    N. Echebest
    M.T. Guardarucci
    H. Scolnik
    M.C. Vacchino
    [J]. Numerical Algorithms, 2004, 35 : 331 - 350
  • [5] An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
    Echebest, N
    Guardarucci, MT
    Scolnik, H
    Vacchino, MC
    [J]. NUMERICAL ALGORITHMS, 2004, 35 (2-4) : 331 - 350
  • [6] Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space
    Barshad, Kay
    Gibali, Aviv
    Reich, Simeon
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2023, 38 (04): : 655 - 667
  • [7] Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
    Aleyner, Arkady
    Reich, Simeon
    [J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2008, 343 (01) : 427 - 435
  • [8] A viscosity method for solving convex feasibility problems
    Zhang, Yunpeng
    Li, Yanling
    [J]. JOURNAL OF NONLINEAR SCIENCES AND APPLICATIONS, 2016, 9 (02): : 641 - 651
  • [9] Incomplete projection algorithms for solving the convex feasibility problem
    Ubaldo M. García-Palomares
    Francisco J. González-Castaño
    [J]. Numerical Algorithms, 1998, 18 : 177 - 193
  • [10] Incomplete projection algorithms for solving the convex feasibility problem
    García-Palomares, UM
    González-Castaño, FJ
    [J]. NUMERICAL ALGORITHMS, 1998, 18 (02) : 177 - 193
12345