A journal of IEEE and CAA , publishes high-quality papers in English on original theoretical/experimental research and development in all areas of automation
Advanced Search
Volume 1 Issue 1
Jan.  2014

IEEE/CAA Journal of Automatica Sinica

  • JCR Impact Factor: 15.3, Top 1 (SCI Q1)
    CiteScore: 23.5, Top 2% (Q1)
    Google Scholar h5-index: 77， TOP 5
Turn off MathJax
Article Contents
Article Navigation >  IEEE/CAA Journal of Automatica Sinica  > 2014  >  1(1): 61-67
Yanqiong Zhang, Youcheng Lou and Yiguang Hong, "An Approximate Gradient Algorithm for Constrained Distributed Convex Optimization," IEEE/CAA J. of Autom. Sinica, vol. 1, no. 1, pp. 61-67, 2014.
Citation: Yanqiong Zhang, Youcheng Lou and Yiguang Hong, "An Approximate Gradient Algorithm for Constrained Distributed Convex Optimization," IEEE/CAA J. of Autom. Sinica, vol. 1, no. 1, pp. 61-67, 2014.
shu

An Approximate Gradient Algorithm for Constrained Distributed Convex Optimization

  • 1. Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China;

  • 2. National Center for Mathematics and Interdisciplinary Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China;

  • 3. Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China

Funds:

This work was supported by National Natural Science Foundation of China (61174071).

    Abstract
  • In this paper, we propose an approximate gradient algorithm for the multi-agent convex optimization problem with constraints. The agents cooperatively compute the minimum of the sum of the local objective functions which are subject to a global inequality constraint and a global constraint set. Instead of each agent can get exact gradient, as discussed in the literature, we only use approximate gradient with some computation or measurement errors. The gradient accuracy conditions are presented to ensure the convergence of the approximate gradient algorithm. Finally, simulation results demonstrate good performance of the approximate algorithm.

     

    • FullText(HTML)
  • loading
    • References(24)
  • [1]
    Shi G D, Johansson K H, Hong Y G. Reaching an optimal consensus:dynamical systems that compute intersections of convex sets. IEEE Transactions on Automatic Control, 2013, 58(3):610-622
    [2]
    Shi G D, Johansson K H. Randomized optimal consensus of multi-agent systems. Automatica, 2012, 48(12):3018-3033
    [3]
    Lou Y C, Hong Y G. Target containment control of multi-agent systems with random switching interconnection topologies. Automatica, 2012, 48(5):879-885
    [4]
    Lou Y C, Shi G D, Johansson K H, Hong Y G. Reaching optimal consensus for multi-agent systems based on approximate projection. In:Proceedings of the 10th World Congress on Intelligent Control and Automation (WCICA). Beijing, China:IEEE, 2012. 2794-2800
    [5]
    Ren W, Beard R. Consensus seeking in multi-agent systems under dynamically changing interaction topologies. IEEE Transactions on Automatic Control, 2005, 50(5):655-661
    [6]
    Olfati-Saber R. Flocking for multi-agent dynamic systems:algorithms and theory. IEEE Transactions on Automatic Control, 2006, 51(3):401-420
    [7]
    Tang Y, Hong Y. Hierarchical distributed control design for multi-agent systems using approximate simulation. Acta Automatica Sinica, 2013, 39(6):868-874
    [8]
    Chen J, Yu M, Dou L, Gan M. A fast averaging synchronization algorithm for clock oscillators in nonlinear dynamical network with arbitrary time-delays. Acta Automatica Sinica, 2010, 36(6):873-880
    [9]
    Rabbat M, Nowak R. Distributed optimization in sensor networks. In:Proceedings of the 3rd International Symposium on Information Processing of Sensor Networks. Berkeley, CA:IEEE, 2004. 20-27
    [10]
    Wan P, Lemmon M D. Event-triggered distributed optimization in sensor networks. In:Proceedings of the 2010 International Conference on Information Processing of Sensor Networks. San Francisco, CA:IEEE, 2010. 49-60
    [11]
    Nedic A, Ozdaglar A. Distributed subgradient methods for multi-agent optimization. IEEE Transactions on Automatic Control, 2009, 54(1):48-61
    [12]
    Nedic A, Ozdaglar A, Parrilo P A. Constrained consensus and optimization in multi-agent networks. IEEE Transactions on Automatic Control, 2010, 55(4):922-938
    [13]
    Nedic A, Ozdaglar A. Subgradient methods for saddle-point problems. Journal of Optimization Theory and Applications, 2009, 142(1):205-228
    [14]
    Johansson B, Rabi M, Johansson M. A randomized incremental subgradient method for distributed optimization in networked systems. SIAM Journal on Control and Optimization, 2009, 20(3):1157-1170
    [15]
    Lu J, Tang C Y, Regier P R, Bow T D. Gossip algorithms for convex consensus optimization over network. IEEE Transactions on Automatic Control, 2011, 56(12):2917-2923
    [16]
    Lu J, Regier P R, Tang C Y. Control of distributed convex optimization. In:Proceedings of the 49th IEEE Conference on Decision and Control. Atlanta, GA:IEEE, 2010. 489-495
    [17]
    Jakovetic D, Xavier J, Moura J M. Cooperative convex optimization in networked systems:augmented Lagrangian algorithm with directed gossip communication. IEEE Transactions on Signal Processing, 2011, 59(8):3889-3902
    [18]
    Rabbat M, Nowak R. Decentralized source localization and tracking. In:Proceedings of the 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP, 2004). Montreal, Que:IEEE, 2004. 921-924
    [19]
    Kelly F, Maulloo A, Tan D. Rate control for communication networks:shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 1998, 49(3):237-252
    [20]
    Oliveira A R L, Soares S, Nepomuceno L. Optimal active power dispatch combining network flow and interior point approaches. IEEE Transactions on Power Systems, 2003, 18(4):1235-1240
    [21]
    Zhu M H, Martinez S. On distributed convex optimization under inequality and equality constraints. IEEE Transactions on Automatic Control, 2012, 57(1):151-164
    [22]
    Godsil C, Royle G. Algebraic Graph Theory. New York:Springer-Verlag, 2001
    [23]
    Bertsekas D P, Nedic A, Ozdaglar A. Convex Analysis and Optimization. Belmont, MA:Anthena Science, 2003
    [24]
    Poljak B T. Introduction to Optimization. New York:Optimization Software Inc., 2001
    • Related Articles
    • Supplements(0)

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views (1298) PDF downloads(36) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return