Finite-Time Convergent Algorithms for Time-Varying Distributed Optimization
This letter focuses on finite-time (FT) convergent distributed algorithms for solving time-varying (TV) distributed optimization (TVDO). The objective is to minimize the sum of local TV cost functions subject to the possible TV constraints by the coordination of multiple agents in finite time. Speci...
        Saved in:
      
    
          | Published in | IEEE control systems letters Vol. 7; pp. 3223 - 3228 | 
|---|---|
| Main Authors | , , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
            IEEE
    
        2023
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 2475-1456 2475-1456  | 
| DOI | 10.1109/LCSYS.2023.3312297 | 
Cover
| Summary: | This letter focuses on finite-time (FT) convergent distributed algorithms for solving time-varying (TV) distributed optimization (TVDO). The objective is to minimize the sum of local TV cost functions subject to the possible TV constraints by the coordination of multiple agents in finite time. Specifically, two classes of TVDO are investigated included unconstrained distributed consensus optimization and distributed optimal resource allocation problems (DORAP) with both TV cost functions and coupled equation constraints. For the previous one, based on non-smooth analysis, a continuous-time distributed discontinuous dynamics with FT convergence is proposed based on an extended zero-gradient-sum method with a local auxiliary subsystem. Then, an FT convergent distributed dynamics is further obtained for TV-DORAP by dual transformation. Particularly, the inversion of the cost functions' Hessians is not required in the dual variables' dynamics, while another local optimization needs to be solved at each time instant. Finally, two numerical examples are conducted to verify the proposed algorithms. | 
|---|---|
| ISSN: | 2475-1456 2475-1456  | 
| DOI: | 10.1109/LCSYS.2023.3312297 |