Skip to main content
Log in

The Walrasian Equilibrium and Centralized Distributed Optimization in Terms of Modern Convex Optimization Methods by an Example of the Resource Allocation Problem

  • Published:
Numerical Analysis and Applications Aims and scope Submit manuscript

Abstract

The resource allocation problem and its numerical solution are considered. The following is demonstrated: (1) Walrasian price-adjustment mechanism for determining the equilibrium state; (2) decentralized role of prices; (3) Slater’s method for price restrictions (dual Lagrange multipliers); (4) new mechanism for determining equilibrium prices, in which prices are fully controlled by economic agents—nodes (enterprises)—rather than by the Center (Government). In the economic literature, only the convergence of the methods considered is proved. In contrast, this paper provides an accurate analysis of the convergence rate of the described procedures for determining the equilibrium. The analysis is based on the primal-dual nature of the algorithms proposed. More precisely, in this paper, we propose the economic interpretation of the following numerical primal-dual methods of convex optimization: dichotomy and subgradient projection method.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Danskin, J.M., The Theory of Max-Min and Its Application to Weapons Allocation Problem, Springer, 1967.

  2. Dem’yanov, V.F. and Malozemov, V.N., Vvedenie v minnimaks (Introduction into Minimax), Moscow: Nauka, 1972.

    MATH  Google Scholar 

  3. Aubin, J.-P., Applied Nonlinear Analysis, Dover, 2006.

  4. Rockafellar, R.T., Convex Analysis, Princeton Univ., 1997.

  5. Allen-Zhu, Z. and Orecchia, L., Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent; URL: https://doi.org//abs/1407.1537.

  6. Bertsekas, D.P., Extended Monotropic Programming and Duality, J. Optim. Th. Appl., 2008, vol. 139, no. 2, pp. 209–225.

    Article  MathSciNet  Google Scholar 

  7. Bertsekas, D.P., Nedic, A., and Ozdaglar, A.E., Convex Analysis and Optimization, Belmont, Massachusetts: Athena Scientific, 2003.

    MATH  Google Scholar 

  8. Bertsekas, D.P. and Tsitsiklis, J.N., Parallel and Distributed Optimization: Numerical Methods, Prentice-Hall Int., 1989.

  9. Boyd, S. and Vandenberghe, L., Convex Optimization, Cambridge Univ. Press, 2004.

  10. Friedman, E.J. and Oren, S.S., The Complexity of Resource Allocation and Price Mechanisms under Bounded Rationality, Econ. Th., 1995, vol. 6, no. 2, pp. 225–250.

    Article  Google Scholar 

  11. Gasnikov, A.V., Sovremennye chislennye metody optimizatsii. Metod universal’nogo gradientnogo spuska, Uchebnoe posobie (Advanced Numerical Methods of Optimization. Universal Gradient Descent Method, Tutorial) Moscow: MFTI, 2018; URL: https://arxiv.org/pdf/1711.00394.pdf.

    Google Scholar 

  12. Nedic, A. and Ozdaglar, A., Cooperative Distributed Multi-Agent Optimizations, in Convex Optimization in Signal Processing and Communications, Eldar, Y. and Palomar, D., Eds., Cambridge Univ. Press, 2010, pp. 340–386.

  13. Nesterov, Yu., Smooth Minimization of Non-Smooth Functions, Math. Programm., 2005, vol. 103, pp. 127–152.

    Article  MathSciNet  Google Scholar 

  14. Nesterov, Yu., Primal-Dual Subgradient Methods for Convex Problems, Math. Programm., Ser. B, 2009, vol. 120, no. 1, pp. 261–283.

    Article  MathSciNet  Google Scholar 

  15. Nesterov, Yu. and Shikhman, V., Distributed Price Adjustment Based on Convex Analysis, J. Optim. Th. Appl., 2017, vol. 172, no. 2, pp. 594–622.

    Article  MathSciNet  Google Scholar 

  16. Resource Allocation Problem. Python Code, URL: https://github.com/evorontsova/Resource-allocation-problem/blob/master/Resource_allocation_problem.ipynb.

  17. Rockafellar, R.T., Monotropic Programming: Descent Algorithms and Duality, in Nonlinear Programming, iss. 4, Mangasarian, O.L., Meyer, R.R., and Robinson, S.M., Eds., New York: Academic Press, 1981, pp. 327–366.

    Google Scholar 

  18. Ivanova, A., Dvurechensky, P., Gasnikov, A., and Kamzolov, D., Composite Optimization for the Resource Allocation Problem; URL: https://arxiv.org/pdf/1810.00595.pdf.

Download references

Acknowledgments

The authors are grateful to A. Nedic, Yu.E. Nesterov, and A.A. Shananin for valuable comments on the paper.

Funding

This work was supported by the Russian Foundation for Basic Research, grant no. 18-29-03071, and by the Council for Grants (under RF President), grant no. MD-1320.2018.1.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to E. A. Vorontsova, A. V. Gasnikov, A. S. Ivanova or E. A. Nurminsky.

Additional information

Russian Text © The Author(s), 2019, published in Sibirskii Zhurnal Vychislitel’noi Matematiki, 2019, Vol. 22, No. 4, pp. 411–432.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vorontsova, E.A., Gasnikov, A.V., Ivanova, A.S. et al. The Walrasian Equilibrium and Centralized Distributed Optimization in Terms of Modern Convex Optimization Methods by an Example of the Resource Allocation Problem. Numer. Analys. Appl. 12, 338–358 (2019). https://doi.org/10.1134/S1995423919040037

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1995423919040037

Keywords

Navigation