Gradient-Type Methods For Decentralized Optimization Problems With Polyak-{\L}ojasiewicz Condition Over Time-Varying Networks

arXiv2210.03810MaRDI QIDQ6413271FDOQ6413271

Authors: Ilya A. Kuruzov, Mohammad S. Alkousa, F. S. Stonyakin, A. V. Gasnikov 

Publication date: 7 October 2022

Abstract: This paper focuses on the decentralized optimization (minimization and saddle point) problems with objective functions that satisfy Polyak-{L}ojasiewicz condition (PL-condition). The first part of the paper is devoted to the minimization problem of the sum-type cost functions. In order to solve a such class of problems, we propose a gradient descent type method with a consensus projection procedure and the inexact gradient of the objectives. Next, in the second part, we study the saddle-point problem (SPP) with a structure of the sum, with objectives satisfying the two-sided PL-condition. To solve such SPP, we propose a generalization of the Multi-step Gradient Descent Ascent method with a consensus procedure, and inexact gradients of the objective function with respect to both variables. Finally, we present some of the numerical experiments, to show the efficiency of the proposed algorithm for the robust least squares problem.

This page was built for publication: Gradient-Type Methods For Decentralized Optimization Problems With Polyak-{\L}ojasiewicz Condition Over Time-Varying Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6413271)