SCIENCE CHINA Information Sciences, Volume 63 , Issue 8 : 189201(2020) https://doi.org/10.1007/s11432-018-9682-4

Distributed algorithms for solving the convex feasibility problems

More info
  • ReceivedApr 12, 2018
  • AcceptedOct 31, 2018
  • PublishedMar 3, 2020


There is no abstract available for this article.


This work was supported by National Natural Science Foundation of China (Grant Nos. 61751301, 61533001).


Appendixes A and B.


[1] Nedic A, Ozdaglar A. Distributed subgradient methods for multi-agent optimization. IEEE Trans Automat Contr, 2009, 54: 48-61 CrossRef Google Scholar

[2] Nedic A, Ozdaglar A, Parrilo P A. Constrained Consensus and Optimization in Multi-Agent Networks. IEEE Trans Automat Contr, 2010, 55: 922-938 CrossRef Google Scholar

[3] Lu K, Jing G, Wang L. Distributed Algorithm for Solving Convex Inequalities. IEEE Trans Automat Contr, 2018, 63: 2670-2677 CrossRef Google Scholar

[4] Zhu M H, Martinez S. On Distributed Convex Optimization Under Inequality and Equality Constraints. IEEE Trans Automat Contr, 2012, 57: 151-164 CrossRef Google Scholar

[5] Wang L, Shi H, Chu T G, et al. Aggregation of foraging swarms. In: Advances in Artificial Intelligence. Berlin: Springer, 2004. 3339: 766--777. Google Scholar

[6] Wang L, Xiao F. Finite-Time Consensus Problems for Networks of Dynamic Agents. IEEE Trans Automat Contr, 2010, 55: 950-955 CrossRef Google Scholar

[7] Mou S, Liu J, Morse A S. A Distributed Algorithm for Solving a Linear Algebraic Equation. IEEE Trans Automat Contr, 2015, 60: 2863-2878 CrossRef Google Scholar

[8] Cao H, Gibson T E, Mou S, et al. Impacts of network topology on the performance of a distributed algorithm solving linear equations. In: Prcoeedings of 2016 IEEE 55th Conference on Decision and Control (CDC). New York: IEEE, 2016. 1733--1738. Google Scholar

[9] Wang L, Xiao F. A new approach to consensus problems in discrete-time multiagent systems with time-delays. Sci China Ser F-Inf Sci, 2007, 50: 625-635 CrossRef Google Scholar

  • Figure 1

    (Color online) (a) Feasible region of the CFP; (b) the communication graph; (c) the trajectory of the multi-agent system in the continuous-time case; (d) the trajectory of the multi-agent system in the discrete-time case. “*" represents the initial states of the agents while “$\circ$" represents their final states.