This article is cited in 2 scientific papers (total in 2 papers)
The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem
Abstract:
We consider the resource allocation problem and its numerical solution. The following is demonstrated: 1) the Walrasian price-adjustment mechanism for determining the equilibrium; 2) the decentralized role of the prices; 3) Slater’s method for price restrictions (dual Lagrange multipliers); 4) a new mechanism for determining equilibrium prices, in which prices are fully controlled not by Center (Government), but by economic agents — nodes (factories). 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 the convex optimization: dichotomy and subgradient projection method.
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.
Citation:
E. A. Vorontsova, A. V. Gasnikov, A. S. Ivanova, E. A. Nurminsky, “The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem”, Sib. Zh. Vychisl. Mat., 22:4 (2019), 415–436; Num. Anal. Appl., 12:4 (2019), 338–358
\Bibitem{VorGasIva19}
\by E.~A.~Vorontsova, A.~V.~Gasnikov, A.~S.~Ivanova, E.~A.~Nurminsky
\paper The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem
\jour Sib. Zh. Vychisl. Mat.
\yr 2019
\vol 22
\issue 4
\pages 415--436
\mathnet{http://mi.mathnet.ru/sjvm723}
\crossref{https://doi.org/10.15372/SJNM20190403}
\transl
\jour Num. Anal. Appl.
\yr 2019
\vol 12
\issue 4
\pages 338--358
\crossref{https://doi.org/10.1134/S1995423919040037}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000513714900003}
Linking options:
https://www.mathnet.ru/eng/sjvm723
https://www.mathnet.ru/eng/sjvm/v22/i4/p415
This publication is cited in the following 2 articles:
D. B. Rokhlin, “On the dual gradient descent method for the resource allocation problem in multiagent systems”, J. Appl. Industr. Math., 18:2 (2024), 316–332
Ivanova A. Dvurechensky P. Gasnikov A. Kamzolov D., “Composite Optimization For the Resource Allocation Problem”, Optim. Method Softw., 36:4 (2021), 720–754