Distributed Conditional Gradient Algorithm for Two-Network Saddle-point Problem

Jie Hou, Xianlin Zeng*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

We consider a two-network saddle-point problem with constraints, whose projections are expensive. We propose a projection-free algorithm, which is referred to as Distributed Frank-Wolfe Saddle-Point algorithm (DFWSP), which combines the gradient tracking technique and Frank-Wolfe technique. We prove that the algorithm achieves O(1/k2) convergence rate for strongly-convex-strongly-concave saddle-point problems. We empirically shows that the proposed algorithm has better numerical performance than the distributed projected saddle-point algorithm.

Original languageEnglish
Title of host publicationProceedings of the 34th Chinese Control and Decision Conference, CCDC 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4261-4266
Number of pages6
ISBN (Electronic)9781665478960
DOIs
Publication statusPublished - 2022
Event34th Chinese Control and Decision Conference, CCDC 2022 - Hefei, China
Duration: 15 Aug 202217 Aug 2022

Publication series

NameProceedings of the 34th Chinese Control and Decision Conference, CCDC 2022

Conference

Conference34th Chinese Control and Decision Conference, CCDC 2022
Country/TerritoryChina
CityHefei
Period15/08/2217/08/22

Keywords

  • Convergence Rate
  • Distributed Algorithm
  • Projection-Free Method
  • Saddle-Point Problem

Fingerprint

Dive into the research topics of 'Distributed Conditional Gradient Algorithm for Two-Network Saddle-point Problem'. Together they form a unique fingerprint.

Cite this