Skip to main content
SpringerLink
Log in

Recent advances on distributed online optimization

  • Letter
  • Published:
Control Theory and Technology Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Zinkevich, M. (2003). Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of 20th international conference on machine learning, Washington, DC, USA (pp. 928–936).

  2. Hazan, E., Agarwal, A., & Kale, S. (2007). Logarithmic regret algorithms for online convex optimization. Machine Learning, 69(2–3), 169–192.

    Article  Google Scholar 

  3. Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009). Online dictionary learning for sparse coding. In Proceedings of the 26th international conference on machine learning, Montreal, Canada (pp. 689–696).

  4. Zhou, X., Dall’Anese, E., Chen, L., & Simonetto, A. (2018). An incentive-based online optimization framework for distribution grids. IEEE Transactions on Automatic Control, 63(7), 2019–2031.

    Article  MathSciNet  Google Scholar 

  5. Shalev-Shwartz, S. (2012). Online learning and online convex optimization. Foundations and Trends in Machine Learning, 4(2), 107–194.

    Article  Google Scholar 

  6. Zhang, L., Lu, S., & Yang, T. (2020). Minimizing dynamic regret and adaptive regret simultaneously. In International conference on artificial intelligence and statistics, Palermo, Italy (pp. 309–319).

  7. Chen, L., Harshaw, C., Hassani, H., & Karbasi, A. (2018). Projection-free online optimization with stochastic gradient: From convexity to submodularity. In Proceedings of the 35th international conference on machine learning, Stockholm, Sweden (pp. 814–823).

  8. Mahdavi, M., Jin, R., & Yang, T. (2012). Trading regret for efficiency: Online convex optimization with long term constraints. Journal of Machine Learning Research, 13, 2503–2528.

    MathSciNet  MATH  Google Scholar 

  9. Jenatton, R., Huang, J., & Archambeau, C. (2016). Adaptive algorithms for online convex optimization with long-term constraints. In Proceedings of the 33rd international conference on machine learning (pp. 402–411).

  10. Yuan, J. & Lamperski, A. (2018). Online convex optimization for cumulative constraints. In Proceedings of Advances in neural information processing systems, Montreal, Canada (pp. 6137–6146).

  11. Yu, H., Neely, M., & Wei, X. (2017). Online convex optimization with stochastic constraints. In Proceedings of advances in neural information processing systems, Long Beach, CA, USA (pp. 1428–1438).

  12. Chen, T., Ling, Q., & Giannakis, G. B. (2017). An online convex optimization approach to proactive network resource allocation. IEEE Transactions on Signal Processing, 65(24), 6350–6364.

    Article  MathSciNet  Google Scholar 

  13. Sun, W., Dey, D., & Kapoor, A. (2017). Safety-aware algorithms for adversarial contextual bandit. In Proceedings of the 34th international conference on machine learning, Sydney, Australia (pp. 3280–3288).

  14. Wei, X., Yu, H., & Neely, M. J. (2019). Online primal-dual mirror descent under stochastic constraints. ACM SIGMETRICS Performance Evaluation Review, 48(1), 3–4.

    Article  Google Scholar 

  15. Zhang, W., Zhao, P., Zhu, W., Hoi, S. C. H., & Zhang, T. (2017). Projection-free distributed online learning in networks. In Proceedings of the 34th international conference on machine learning, Sydney, Australia (pp. 4054–4062).

  16. Mateos-Núnez, D., & Cortés, J. (2014). Distributed online convex optimization over jointly connected digraphs. IEEE Transactions on Network Science and Engineering, 1(1), 23–37.

    Article  MathSciNet  Google Scholar 

  17. Akbari, M., Gharesifard, B., & Linder, T. (2017). Distributed online convex optimization on time-varying directed graphs. IEEE Transactions on Control of Network Systems, 4(3), 417–428.

    Article  MathSciNet  Google Scholar 

  18. Nedić, A., Lee, S., & Raginsky, M. (2015). Decentralized online optimization with global objectives and local communication. In Proceedings of American control conference, Chicago, IL, USA (pp. 4497–4503).

  19. Koppel, A., Jakubiec, F. Y., & Ribeiro, A. (2015). A saddle point algorithm for networked online convex optimization. IEEE Transactions on Signal Processing, 63(19), 5149–5164.

    Article  MathSciNet  Google Scholar 

  20. Shahrampour, S., & Jadbabaie, A. (2018). Distributed online optimization in dynamic environments using mirror descent. IEEE Transactions on Automatic Control, 63(3), 714–725.

    Article  MathSciNet  Google Scholar 

  21. Hosseini, S., Chapman, A., & Mesbahi, M. (2016). Online distributed convex optimization on dynamic networks. IEEE Transactions on Automatic Control, 61(11), 3545–3550.

    Article  MathSciNet  Google Scholar 

  22. Lee, S., Nedić, A., & Raginsky, M. (2017). Stochastic dual averaging for decentralized online optimization on time-varying communication graphs. IEEE Transactions on Automatic Control, 62(12), 6407–6414.

    Article  MathSciNet  Google Scholar 

  23. Yuan, D., Ho, D. W. C., & Jiang, G. (2018). An adaptive primal-dual subgradient algorithm for online distributed constrained optimization. IEEE Transactions on Cybernetics, 48(11), 3045–3055.

    Article  Google Scholar 

  24. Lee, S. & Zavlanos, M. M. (2017). On the sublinear regret of distributed primal-dual algorithms for online constrained optimization. arXiv:1705.11128.

  25. Li, X., Chen, M. Z. Q., & Su, H. (2019). Quantized consensus of multi-agent networks with sampled data and Markovian interaction links. IEEE Transactions on Cybernetics, 49(5), 1816–1825.

    Article  Google Scholar 

  26. Li, X., & Xie, L. (2018). Dynamic formation control over directed networks using graphical Laplacian approach. IEEE Transactions on Automatic Control, 63(11), 3761–3774.

    Article  MathSciNet  Google Scholar 

  27. Wang, X., Yi, P., & Hong, Y. (2014). Dynamic optimization for multi-agent systems with external disturbances. Control Theory and Technology, 12(2), 132–138.

    Article  MathSciNet  Google Scholar 

  28. Qiu, Z., Xie, L., & Hong, Y. (2019). Distributed optimal consensus of multiple double integrators under bounded velocity and acceleration. Control Theory and Technology, 17(1), 85–98.

    Article  MathSciNet  Google Scholar 

  29. Meng, M., & Li, X. (2020). Distributed nonlinear estimation over unbalanced directed networks. IEEE Transactions on Signal Processing, 68, 6212–6223.

    Article  MathSciNet  Google Scholar 

  30. Li, X., Yi, X., & Xie, L. (2020). Distributed online optimization for multi-agent networks with coupled inequality constraints. IEEE Transactions on Automatic Control. https://doi.org/10.1109/TAC.2020.3021011.

    Article  Google Scholar 

  31. Yi, X., Li, X., Xie, L., & Johansson, K. H. (2020). Distributed online convex optimization with time-varying coupled inequality constraints. IEEE Transactions on Signal Processing, 68(1), 731–746.

    Article  MathSciNet  Google Scholar 

  32. Yi, X., Li, X., Yang, T., Xie, L., Johansson, K. H., & Chai, T. (2020). Distributed bandit online convex optimization with time-varying coupled inequality constraints. IEEE Transactions on Automatic Control. https://doi.org/10.1109/TAC.2020.3030883.

    Article  Google Scholar 

  33. Zhao, Y., Qiu, S., & Liu, J. (2019). Proximal online gradient is optimum for dynamic regret. arXiv:1810.03594.

  34. Hazan, E., & Kale, S. (2014). Beyond the regret minimization barrier: Optimal algorithms for stochastic strongly-convex optimization. The Journal of Machine Learning Research, 15(1), 2489–2512.

    MathSciNet  MATH  Google Scholar 

  35. Mokhtari, A., Shahrampour, S., Jadbabaie, A., & Ribeiro, A. (2016). Online optimization in dynamic environments: Improved regret rates for strongly convex problems. In Proceedings of IEEE conference on decision and control (CDC), Las Vegas, NV, USA (pp. 7195–7201).

  36. Ravier, R. J., Calderbank, A. R., & Tarokh, V. (2019). Prediction in online convex optimization for parametrizable objective functions. In Proceedings of IEEE conference on decision and control (CDC), Nice, France (pp. 2455–2460).

  37. Lesage-Landry, A., Shames, I., & Taylor, J. A. (2020). Predictive online convex optimization. Automatica, 113, 108771.

    Article  MathSciNet  Google Scholar 

  38. Li, Y., Qu, G., & Li, N. (2020). Online optimization with predictions and switching costs: Fast algorithms and the fundamental limit. IEEE Transactions on Automatic Control. https://doi.org/10.1109/TAC.2020.3040249.

    Article  Google Scholar 

  39. Hsieh, Y.-G., Iutzeler, F., Malick, J., & Mertikopoulos, P. (2020). Multi-agent online optimization with delays: Asynchronicity, adaptivity, and optimism. arXiv:2012.11579.

  40. Cao, X., Zhang, J., & Poor, H. V. (2020). Constrained online convex optimization with feedback delays. IEEE Transactions on Automatic Control. https://doi.org/10.1109/TAC.2020.3030743.

    Article  Google Scholar 

  41. Akbari, M., Gharesifard, B., & Linder, T. (2015). Distributed online convex optimization on time-varying directed graphs. IEEE Transactions on Control of Network Systems, 4(3), 417–428.

    Article  MathSciNet  Google Scholar 

  42. Lei, J., Yi, P., Hong, Y., Chen, J., & Shi, G. (2020). Online convex optimization over Erdos–Renyi random networks. In Advances in neural information processing systems.

  43. Lü, Q., Liao, X., Xiang, T., Li, H., & Huang, T. (2020). Privacy masking stochastic subgradient-push algorithm for distributed online optimization. IEEE Transactions on Cybernetics. https://doi.org/10.1109/TCYB.2020.2973221.

    Article  Google Scholar 

  44. Li, X., Yi, X., & Xie, L. (2020). Distributed online convex optimization with an aggregative variable. arXiv:2007.06844.

  45. Agarwal, N., Bullins, B., Hazan, E., Kakade, S., & Singh, K. (2019). Online control with adversarial disturbances. In International conference on machine learning, Long Beach, California (pp. 111–119).

  46. Fisac, J. F., Akametalu, A. K., Zeilinger, M. N., Kaynama, S., Gillula, J., & Tomlin, C. J. (2018). A general safety framework for learning-based control in uncertain robotic systems. IEEE Transactions on Automatic Control, 64(7), 2737–2752.

    Article  MathSciNet  Google Scholar 

  47. Lazic, N., Boutilier, C., Lu, T., Wong, E., Roy, B., Ryu, M., & Imwalle, G. (2018). Data center cooling using model-predictive control. In Advances in neural information processing systems, Montreal, Canada (pp. 3818–3827).

  48. Li, Y., Das, S., & Li, N. (2020). Online optimal control with affine constraints. arXiv:2010.04891.

Download references

Acknowledgements

This work was supported by the Shanghai Municipal Science and Technology Major Project (No. 2021SHZDZX0100), the Shanghai Municipal Commission of Science and Technology (No. 19511132101) and the National Natural Science Foundation of China (Nos. 62003243, 62088101).

Author information

Authors and Affiliations

  1. Department of Control Science and Engineering, College of Electronics and Information Engineering, the Institute for Advanced Study, and the Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University, Shanghai, 201210, China

    Xiuxian Li

Authors
  1. Xiuxian Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiuxian Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, X. Recent advances on distributed online optimization. Control Theory Technol. 19, 153–156 (2021). https://doi.org/10.1007/s11768-021-00041-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11768-021-00041-3

Search

Navigation