Cited by 5Distributed Control Multi-Agent SystemsAdvanced Control Systems OptimizationOptimal Power Flow Distribution

The DOI matches its Crossref record, with a small difference in title or year; 3 of the 3 references it cites were found in a registry or an index.

Augmented distributed optimization for networked systems

Open access

Abstract

My special

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.32657/10356/68805

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The DIGing algorithm is a minor variation of algorithms that have appeared in [73,74] and [15-17].

    “The algorithm we will study in this paper crucially relies on tracking differences of gradients and is a minor variation of algorithms that have appeared in [73,74] and [15-17].”

    From Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2017) · cites this paper as [73]

    Section 5.4 describes AugDGM as using dynamic average consensus to track gradients through their differences, supporting the claimed algorithmic resemblance. Our copy does not identify DIGing or establish that it is a minor variation of AugDGM or the other cited algorithms. No page number is available for the indexed passage. (LLM, conf=0.77)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 82

  1. J. Baillieul and P. J. Antsaklis. Control and communication challenges in networked real-time systems. In Proceedings of the IEEE, volume 95, pages 9-28, Jun 2007.
  2. A. Aquino-Lugo. Distributed and decentralized control of the power grid. PhD thesis, University of Illinois at Urbana-Champaign, 2010.
  3. R. L. Raffard, C. J. Tomlin, and S. P. Boyd. Distributed optimization for cooperative agents: Application to formation flight. In Proceedings of 43rd IEEE Conference on Decision and Control, pages 2453-2459, Dec. 2004.
  4. M. Rabbat and R. Nowak. Distributed optimization in sensor networks. In Proceedings of 3rd International Symposium on Information Processing in Sen- sor Networks, pages 20-27, April 2004.
  5. L. Xiao, M. Johansson, and S. P. Boyd. Simultaneous routing and resource allocation via dual decomposition. IEEE Trans. Commun., 52(7):1136-1144, July 2004.
  6. J. Chen and A. H. Sayed. Diffusion adaptation strategies for distributed op- timization and learning over networks. IEEE Trans. Signal Process, 60(8): 4289-4305, May 2012.
  7. J. B. Predd, S. R. Kulkarni, and H. V. Poor. A collaborative training algorithm for distributed learning. IEEE Trans. Inf. Theory, 55(4):1856-1871, April 2009.
  8. J. C. Duchi, A. Agarwal, and M. J. Wainwright. Dual averaging for distributed optimization: Convergence analysis and network scaling. IEEE Trans. Autom. Control, 57(3):592-606, March 2012.
  9. D. Jakovetic, J. Xavier, and J. M. F. Moura. Fast distributed gradient meth- ods. IEEE Trans. Autom. Control, 59(5):1131-1146, May 2014.
  10. A. Nedic and A. Olshevsky. Stochastic gradient-push for strongly convex functions on time-varying directed graphs. arXiv:1406.2075, Jun 2014. · arXiv
  11. J. B. Rawlings and B. T. Stewart. Coordinating multiple optimization-based controllers: New opportunities and challenges. Journal of Process Control, 18: 839-845, 2008.
  12. W. B. Dunbar. Distributed receding horizon control of dynamically coupled nonlinear systems. IEEE Trans. Autom. Control, 52:1249-1263, July 2007.
  13. F. Borrelli and T. Keviczky. Distributed LQR design for identical dynamically decoupled systems. IEEE Trans. Autom. Control, Sep. 2008.
  14. K. B. Ariyur and M. Krstic. Real-time optimization by Extremum-seeking Control. Hoboken, NJ : Wiley Interscience, 2003.
  15. Y. Tan, W. Moase, C. Manzie, D. Neic, and I. Mareels. Extremum seeking from 1922 to 2010. In Proceedings of 29th Chinese Control Conference, pages 14-26, July 2010.
  16. M. S. Stankovic, K. H. Johansson, and D. M. Stipanovic. Distributed seeking of nash equilibria with applications to mobile sensor networks. IEEE Trans. Autom. Control, 57(4):904-919, April 2012.
  17. P. Frihauf, M. Krstic, and T. Basar. Nash equilibrium seeking in noncooper- ative games. IEEE Trans. Autom. Control, 57(5):1192-1207, Oct. 2012.
  18. S. L. Waslander, G. Inalhan, and C. J. Tomlin. Decentralized optimization via Nash bargaining. In Theory and Algorithms for Cooperative Systems, pages 565-583. World Scientific Pub. Co. Inc., Destin, 2003.
  19. J. Tsitsiklis, D. Bertsekas, and M. Athans. Distributed asynchronous deter- ministic and stochastic gradient optimization algorithms. IEEE Trans. Autom. Control, 31(9):803-812, Sep. 1986.
  20. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algo- rithms. IEEE/ACM Transactions on Networking (TON), 14(SI):2508-2530, June 2006.
  21. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proceedings of 44th Annual IEEE Symposium on Foundations of Computer Science, pages 482-491, Oct 2003.
  22. A. Nedic and A. Ozdaglar. Distributed subgradient methods for Multi-agent optimization. IEEE Trans. Autom. Control, 54(1):48-61, Jan 2009.
  23. H. Terelius, U. Topcu, and R. M. Murray. Decentralized multi-agent optimiza- tion via dual decomposition. In Proceedings of the 18th IFAC World Congress, number 18, pages 11245-11251, Aug 2011.
  24. S. H. Low and D. E. Lapsley. Optimization flow control. I. Basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7:861-874, 1999.
  25. J. Xu and Y. C. Soh. Distributed extremum seeking control of networked large-scale systems under constraints. In Proceedings of IEEE 52nd Annual Conference on Decision and Control (CDC), pages 2187-2192, 2013.
  26. K. Kvaternik and L. Pavel. An analytic framework for decentralized extremum seeking control. In Proceedings of American Control Conference (ACC), 2012, pages 3371-3376, 2012.
  27. M. Rotea. Analysis of multivariable extremum seeking algorithms. In Pro- ceedings of the 2000 American Control Conference., pages 433-437, 2000.
  28. J. C. Spall. An overview of the simultaneous perturbation method for efficient optimization. Johns Hopkins APL Technical Digest, 19(4):482-492, 1998.
  29. Nusawardhana and S. H. Zak. Simultaneous perturbation extremum seek- ing method for dynamic optimization problems. In Proceedings of the 2004 American Control Conference, volume 3, pages 2805-2810, 2004.
  30. A. Ghaffari, M. Krstic, and D. Nešić. Multivariable newton-based extremum seeking. Automatica, 48(8):1759-1767, 2012.
  31. F. Zanella, D. Varagnolo, A. Cenedese, G. Pillonetto, and L. Schenato. Newton-Raphson consensus for distributed convex optimization. In Proceed- ings of 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC), pages 5917-5922, Dec 2011.
  32. A. Nedic, A. Ozdaglar, and P. A. Parrilo. Constrained consensus and optimiza- tion in multi-agent networks. IEEE Trans. Autom. Control, 55(4):922-938, April 2010.
  33. M. Zhu and S. Martinez. On distributed convex optimization under inequality and equality constraints. IEEE Trans. Autom. Control, 57(1):151-164, Jan 2012.
  34. D. Yuan, S. Xu, and H. Zhao. Distributed Primal-Dual subgradient method for Multi-agent optimization via consensus algorithms. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 41:1715-1724, 2011.
  35. K. Srivastava and A. Nedic. Distributed asynchronous constrained stochastic optimization. IEEE J. Sel. Topics Signal Process., 5(4):772-790, Aug 2011.
  36. B. Gharesifard and J. Cortes. Distributed continuous-time convex optimiza- tion on weight-balanced digraphs. IEEE Trans. Autom. Control, 59(3):781- 786, March 2014.
  37. M. Benzi, G. H. Golub, and J. Liesen. Numerical solution of saddle point problems. Acta numerica, 14(1):1-137, 2005.
  38. M. Fortin and R. Glowinski. Augmented Lagrangian methods: Applications to the numerical solution of boundary-value problems. Elsevier, 2000.
  39. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed opti- mization and statistical learning via the alternating direction method of mul- tipliers. Foundations and Trends in Machine Learning, 3(1):1-122, Jan 2011. ISSN 1935-8237.
  40. J. F. C. Mota, J. M. F. Xavier, P. M. Q. Aguiar, and M. Puschel. D-ADMM: A communication-efficient distributed algorithm for separable optimization. IEEE Trans. Signal Process, 61(10):2718-2723, May 2013.
  41. E. Wei and A. E. Ozdaglar. Distributed alternating direction method of mul- tipliers. In Proceedings of IEEE 51st Annual Conference on Decision and Control (CDC), pages 5445-5450, 2012.
  42. W. Shi, Q. Ling, K. Yuan, G. Wu, and W. Yin. On the linear convergence of the ADMM in decentralized consensus optimization. IEEE Trans. Signal Process, 62(7):1750-1761, Feb. 2014.
  43. R. T. Rockafellar. Monotone operators and the proximal point algorithm. SIAM J. Control Optim., 14(5):877-898, 1976.
  44. J. Eckstein and D. P. Bertsekas. On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Mathe- matical Programming, 55(1-3):293-318, 1992.
  45. H. H. Bauschke and P. L. Combettes. Convex analysis and monotone operator theory in Hilbert spaces. Springer Science & Business Media, 2011.
  46. P. L. Combettes and J.-C. Pesquet. Proximal splitting methods in signal processing. In Fixed-point algorithms for inverse problems in science and en- gineering, pages 185-212. Springer, 2011.
  47. A. Chambolle and T. Pock. A first-order primal-dual algorithm for convex problems with applications to imaging. Journal of Mathematical Imaging and Vision, 40(1):120-145, 2011.
  48. S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin. An iterative regulariza- tion method for total variation-based image restoration. Multiscale Modeling & Simulation, 4(2):460-489, 2005.
  49. T. Goldstein and S. Osher. The split bregman method for l1-regularized prob- lems. SIAM J. Imaging Sci., 2(2):323-343, 2009.
  50. X. Zhang, M. Burger, X. Bresson, and S. Osher. Bregmanized nonlocal regu- larization for deconvolution and sparse reconstruction. SIAM J. Imaging Sci., 3(3):253-276, 2010.
  51. K. Srivastava, A. Nedić, and D. Stipanović. Distributed bregman-distance algorithms for min-max optimization. In Agent-Based Optimization, pages 143-174. Springer, 2013.
  52. W. Yin, S. Osher, D. Goldfarb, and J. Darbon. Bregman iterative algorithms for ℓ 1 -minimization with applications to compressed sensing. SIAM J. Imaging Sci., 1(1):143-168, 2008.
  53. A. Nedic. Asynchronous broadcast-based convex optimization over a network. IEEE Trans. Autom. Control, 56(6):1337-1351, June 2011.
  54. E. Wei and A. Ozdaglar. On the O(1/k) convergence of asynchronous dis- tributed alternating direction method of multipliers. In 2013 IEEE Global Conference on Signal and Information Processing, pages 551-554, 2013.
  55. J. Wang and N. Elia. A control perspective for centralized and distributed convex optimization. In Proceedings of 50th IEEE Conference on Decision and Control and European Control Conference, pages 3800-3805, Dec 2011.
  56. D. Jakovetic, J. M. F. Moura, and J. Xavier. Linear convergence rate of a class of distributed augmented lagrangian algorithms. IEEE Trans. Autom. Control, 60(4):922-936, Oct 2015.
  57. W. Shi, Q. Ling, G. Wu, and W. Yin. A proximal gradient algorithm for decentralized composite optimization. IEEE Trans. Signal Process., 63(22): 6013-6023, Nov 2015.
  58. P. Bianchi and W. Hachem. A primal-dual algorithm for distributed optimiza- tion. In Proceedings of 2014 IEEE 53rd Annual Conference on Decision and Control (CDC), pages 4240-4245, 2014.
  59. I. Lobel and A. Ozdaglar. Distributed subgradient methods for convex opti- mization over random networks. IEEE Trans. Autom. Control, 56(6):1291- 1306, Nov 2011.
  60. F. Zanella, D. Varagnolo, A. Cenedese, G. Pillonetto, and L. Schenato. Asyn- chronous Newton-Raphson consensus for distributed convex optimization. In Proceedings of 3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems (NecSys 12), pages 133-138, 2012.
  61. F. Iutzeler, P. Bianchi, P. Ciblat, and W. Hachem. Asynchronous distributed optimization using a randomized alternating direction method of multipliers. In Proceedings of IEEE 52nd Annual Conference on Decision and Control (CDC), pages 3671-3676, 2013.
  62. M. H. DeGroot. Reaching a consensus. Journal of the American Statistical Association, 69(345):118-121, 1974.
  63. G. C. Walsh, H. Ye, and L. G. Bushnell. Stability analysis of networked control systems. IEEE Trans. Control Syst. Technol., 10(3):438-446, 2002.
  64. D. Nešić and A. R. Teel. Input-to-state stability of networked control systems. Automatica, 40(12):2121-2128, 2004.
  65. A. Dembo and T. Kailath. Model-free distributed learning. IEEE Trans. Neural Netw., 1(1):58-70, Mar 1990.
  66. R. T. Marler and J. S. Arora. Survey of multi-objective optimization methods for engineering. Structural and multidisciplinary optimization, 26(6):369-395, 2004.
  67. H. K. Khalil. Nonlinear systems. Prentice Hall, 2002.
  68. D Nešić and AR Teel. Input-to-state stability for nonlinear time-varying sys- tems via averaging. Mathematics of Control, Signals and Systems, 14(3):257- 280, 2001.
  69. A. R. Teel, L. Moreau, and D. Nešić. A unified framework for input-to-state stability in systems with two time scales. IEEE Trans. Autom. Control, 48 (9):1526-1544, Sep 2003.
  70. C. Manzie and M. Krstic. Extremum seeking with stochastic perturbations. IEEE Trans. Autom. Control, 54(3):580-585, March 2009.
  71. M. Zhu and S. Martinez. Discrete-time dynamic average consensus. Automat- ica, 46(2):322-329, 2010.
  72. J. R. Marden, S. D. Ruben, and L. Y. Pao. A model-free approach to wind farm control using game theoretic methods. IEEE Trans. Control Syst. Technol., 21(4):1207-1214, May 2013.
  73. P. M. O. Gebraad and J. W. Wingerden. Maximum power-point tracking control for wind farms. Wind Energy, 18(3):429-447, 2015.
  74. K. E. Johnson and N. Thomas. Wind farm control: Addressing the aerody- namic interaction among wind turbines. In Proceedings of the 2009 American Control Conference, pages 2104-2109, 2009.
  75. L. Y. Pao and K. E. Johnson. Control of wind turbines. IEEE Control Systems, 31(2):44-62, March 2011.
  76. A. Ghaffari, M. Krstic, and S. Seshagiri. Power optimization and control in wind energy conversion systems using extremum seeking. IEEE Trans. Control Syst. Technol., 22(5):1684-1695, Sep 2014.
  77. L. Xiao and S. Boyd. Fast linear iterations for distributed averaging. Systems & Control Letters, 53(1):65-78, 2004.
  78. P. L. Combettes and V. R. Wajs. Signal recovery by proximal forward- backward splitting. Multiscale Modeling & Simulation, 4(4):1168-1200, 2005.
  79. L. Condat. A primal-dual splitting method for convex optimization involving lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl., 158(2):460-479, 2013.
  80. S. Kar and J. M. F. Moura. Sensor networks with random links: Topology design for distributed consensus. IEEE Trans. Signal Process, 56(7):3315- 3326, July 2008.
  81. K. Yuan, Q. Ling, and W. Yin. On the convergence of decentralized gradient descent. arXiv preprint arXiv:1310.7063, 2013. · arXiv
  82. A. Gut. Probability: A Graduate Course. New York, NY : Springer Sci- ence+Business Media, Inc., 2005.

Cited by

Sorted by citations

Metadata

Authors
Xu, J.
Corresponding author
Xu, Jinming
Published
2016-01-01
OpenAlex
W2412784992
Cited by
5
References
3
Citations by year
2019: 1 · 2018: 4
Type
dissertation
Language
en
Open access
Locations
DR-NTU (Nanyang Technological University) (submittedVersion)
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
  • Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Optimal Power Flow Distribution
Keywords
distributed optimization, networked systems

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review