Affiliation:
1. Kazan Federal University
Abstract
We propose a modified primal-dual method for general convex optimization problems with changing affine constraints. We establish convergence of the method that uses variable metric matrices at each iteration. This approach yields new opportunities for control of the parameters according to the constraints changes. In case of the multi-agent optimization problems the method can be adjusted to the changing communication topology and enables the agents to choose the parameters separately of each other.
Reference17 articles.
1. Khan, M., Pandurangan, G., Kumar, V.: Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks. IEEE Trans. Paral. Distrib. Syst. 20, 124-139 (2009)
2. Lobel, I., Ozdaglar, A., Feijer, D.: Distributed multi-agent optimization with state-dependent communication. Math. Program. 129, 255-284 (2011)
3. Peng, Z., Yan, M., Yin, W.: Parallel and distributed sparse optimization. The 47th Asilomar Conference on Signals, Systems and Computers, pp.646-659. Pacific Grove, IEEE (2013)
4. Konnov, I.V.: Primal-dual method for optimization problems with changing constraints. In: P. Pardalos et al. (eds.) Mathematical Optimization Theory and Operations Research (MOTOR 2022), Lecture Notes in Computer Science \textbf{13367}, pp. 46-61. Springer, Cham (2022)
5. Antipin, A.S.: On non-gradient methods for optimization of saddle functions. In: Karmanov, V.G. (ed.) Problems of Cybernetics. Methods and Algorithms for the Analysis of Large Systems, pp.4-13. Nauchn. Sovet po Probleme "Kibernetika", Moscow (1988) [In Russian]
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献