Skip to main content

An Algorithm for Decentralized Multi-agent Feasibility Problems

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research: Recent Trends (MOTOR 2023)

Abstract

We consider the feasibility problem in a multi-agent decentralized form, where each agent has the personal information of the feasible subset, which is unknown to other agents. The common feasible set is composed of the agents’ feasible subsets. For solving this problem, we reformulate it in the form of a variational inequality and propose an algorithm based on the projection method. Preliminary test calculations confirm the efficiency of the proposed approach.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Konnov, I.: Decentralized multi-agent optimization based on a penalty method. Optimization 71(15), 4529–4553 (2022). https://doi.org/10.1080/02331934.2021.1950151

    Article  MathSciNet  MATH  Google Scholar 

  2. Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, London (1989)

    MATH  Google Scholar 

  3. Lobel, I., Ozdaglar, A., Feijer, D.: Distributed multi-agent optimization with state-dependent communication. Math. Program. 129, 255–284 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Duchi, J., Agarwal, A., Wainwright, M.: Dual averaging for distributed optimization: convergence analysis and network scaling. IEEE Trans. Autom. Control 57, 592–606 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Nedić, A., Olshevsky, A.: Distributed optimization over time-varying directed graphs. IEEE Trans. Autom. Control 60, 601–615 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  6. Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3, 1–122 (2011)

    Article  MATH  Google Scholar 

  7. Lan, G., Lee, S., Zhou, Y.: Communication-efficient algorithms for decentralized and stochastic optimization. Math. Program. 180, 237–284 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gorbunov, E., Rogozin, A., Beznosikov, A., Dvinskikh, D., Gasnikov, A.: Recent theoretical advances in decentralized distributed convex optimization. In: Nikeghbali, A., Pardalos, P.M., Raigorodskii, A.M., Rassias, M.T. (eds.) High-Dimensional Optimization and Probability. Springer Optimization and Its Applications, vol. 191, pp. 253–325. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-00832-0_8

    Chapter  Google Scholar 

  9. Konnov, I.V.: Nonlinear Optimization and Variational Inequalities. Kazan University Press, Kazan (2013). [in Russian]

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Olga Pinyagina .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pinyagina, O. (2023). An Algorithm for Decentralized Multi-agent Feasibility Problems. In: Khachay, M., Kochetov, Y., Eremeev, A., Khamisov, O., Mazalov, V., Pardalos, P. (eds) Mathematical Optimization Theory and Operations Research: Recent Trends. MOTOR 2023. Communications in Computer and Information Science, vol 1881. Springer, Cham. https://doi.org/10.1007/978-3-031-43257-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43257-6_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43256-9

  • Online ISBN: 978-3-031-43257-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics