Decentralized multi-agent optimization based on a penalty method

References

• Khan M, Pandurangan G, Kumar V. Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks. IEEE Trans Paral Distrib Syst. 2009;20:124–139.
   Web of Science ®Google Scholar
• Lobel I, Ozdaglar A, Feijer D. Distributed multi-agent optimization with state-dependent communication. Math Program. 2011;129:255–284.
   Web of Science ®Google Scholar
• Peng Z, Yan M, Yin W. Parallel and distributed sparse optimization. The 47th Asilomar Conference on Signals, Systems and Computers; Pacific Grove, IEEE; 2013. p. 646–659.
   Google Scholar
• Scutari G, Facchinei F, Song P, et al. Decomposition by partial linearization: parallel optimization of multi-agent systems. IEEE Trans Signal Process. 2014;62:641–656.
   Web of Science ®Google Scholar
• Lasdon LS. Optimization theory for large systems. New York: Macmillan; 1970.
   Google Scholar
• Bensoussan A, Lions JL, Temam R. Sur les methodes de decomposition, de decentralisation et de coordination et applications. In: Lions JL and Marchuk GI editors. Methodes mathematiques de l'Informatique. Paris: Dunod; 1974. p. 133–257
   Google Scholar
• Bertsekas DP, Tsitsiklis JN. Parallel and distributed computation: numerical methods. London: Prentice-Hall; 1989.
   Google Scholar
• Duchi J, Agarwal A, Wainwright M. Dual averaging for distributed optimization: convergence analysis and network scaling. IEEE Trans Autom Control. 2012;57:592–606.
   Web of Science ®Google Scholar
• Nedić A, Olshevsky A. Distributed optimization over time-varying directed graphs. IEEE Trans Autom Control. 2015;60:601–615.
   Web of Science ®Google Scholar
• Boyd S, Parikh N, Chu E, et al. Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn. 2011;3:1–122.
   Google Scholar
• Lan G, Lee S, Zhou Y. Communication-efficient algorithms for decentralized and stochastic optimization. Math Program. 2020;180:237–284.
   Web of Science ®Google Scholar
• Fiacco AV, McCormick GP. Nonlinear programming: sequential unconstrained minimization techniques. New York: John Wiley and Sons; 1968.
   Google Scholar
• Karmanov VG. Mathematical programming. Moscow: Nauka; 1975. [In Russian].
   Google Scholar
• Grossman K, Kaplan AA. Nonlinear programming by unconstrained minimization. Novosibirsk: Nauka; 1981. [In Russian].
   Google Scholar
• Konnov IV. Application of the penalty method to nonstationary approximation of an optimization problem. Russ Math (Iz VUZ). 2014;58(8):49–55.
   Google Scholar
• Razumikhin BS. Iterative method for the solution and decomposition of linear programming problems. Autom Remote Control. 1967;29:427–443.
   Google Scholar
• Mauer I. On utilization of the penalty constant in decomposition of mathematical programming problems. Izv AN ESSR Ser Fiz Mat. 1971;20(4):474–476.
   Google Scholar
• Razumikhin BS. Physical models and methods of equilibrium theory in programming and economics. Moscow: Nauka; 1975. [In Russian].
   Google Scholar
• Umnov AE. The method of penalty functions in problems of large dimension. USSR Comp Maths Math Phys. 1975;15(6):32–45.
   Google Scholar
• Konnov IV. An approximate penalty method with descent for convex optimization problems. Russ Math (Iz VUZ). 2019;63(7):41–55.
   Web of Science ®Google Scholar
• Vasil'yev FP. Optimization methods. Moscow: MTsNMO; 2011. [In Russian].
   Google Scholar
• Ekeland I, Temam R. Convex analysis and variational problems. Amsterdam -- Oxford: North-Holland; 1976.
   Google Scholar
• Konnov IV, Salahuddin. Two-level iterative method for non-stationary mixed variational inequalities. Russ Math (Iz VUZ). 2017;61:44–53.
   Web of Science ®Google Scholar
• Oden JT, Kikuchi N. Theory of variational inequalities with applications to problems of flow through porous media. Int J Eng Sci. 1980;10:1173–1284.
   Web of Science ®Google Scholar
• Lions PL, Mercier B. Splitting algorithms for the sum of two monotone operators. SIAM J Num Anal. 1979;16:964–979.
   Web of Science ®Google Scholar
• Gabay D. Application of the method of multipliers to variational inequalities. In: Fortin M and Glowinski R editors. Augmented Lagrangian methods: application to the numerical solution of boundary-value problems. North-Holland: Amsterdam; 1983. p. 299–331.
   Google Scholar
• Dem'yanov VF, Rubinov AM. Approximate methods for solving extremum problems. Leningrad: Leningrad Univ. Press; 1968. (Engl transl in Elsevier, Amsterdam, 1970).
   Google Scholar
• Bellman R. Introduction to matrix analysis. Philadelphia: SIAM; 1997.
   Google Scholar
• Gantmacher FR. The theory of matrices. Moscow: Nauka; 1966. [In Russian].
   Google Scholar
• Gol'shtein EG, Tret'yakov NV. Modified Lagrange functions. Moscow: Nauka; 1989. Engl trans in John Wiley and Sons, New York, 1996.
   Google Scholar
• Frank M, Wolfe P. An algorithm for quadratic programming. Nav Res Logist Quart. 1956;3:95–110.
   Google Scholar
• Agmon S. The relaxation method for linear inequalities. Can J Math. 1954;6:382–393.
   Web of Science ®Google Scholar
• Chambolle A, Pock T. On the ergodic convergence rates of a first-order primal-dual algorithm. Math Program. 2016;159:253–287.
   Web of Science ®Google Scholar
• Aybat NS, Hamedani EY. A primal–dual method for conic constrained distributed optimization problems. In: Advances in neural information processing systems. 2016. p. 5049–5057.
   Google Scholar