Acta mathematica scientia,Series A ›› 2024, Vol. 44 ›› Issue (4): 1080-1091.

Previous Articles     Next Articles

A Golden Ratio Primal-Dual Algorithm for a Class of Nonsmooth Saddle Point Problems

Nie Jialin(),Long Xianjun*()   

  1. School of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing 400067
  • Received:2023-06-05 Revised:2024-03-25 Online:2024-08-26 Published:2024-07-26
  • Supported by:
    NSFC(11471059);NSF of Chongqing(cstc2021jcyj-msxmX0721);Team Building Project for Graduate Tutors in Chongqing(yds223010);Innovation Project for Graduate Students of Chongqing(CYS240567);Project of Chongqing Technology and Business University(ZDPTTD201908)

Abstract:

In this paper, we present a new golden ratio primal-dual algorithm to solve the nonsmooth saddle point problems, which is full-splitting.Under some appropriate conditions, we prove the sequence generated by the algorithm iteration converges to the solution of the problem, as well as an $ O(1/N) $ ergodic convergence rate result. Finally, with comparisons to Zhu, Liu and Tran-Ding's algorithms, we give some numerical experiments to show the less iterate numbers and CPU time of the proposed method.

Key words: Saddle point problems, Golden ratio, Primal-dual algorithm, Iterate convergence, Ergodic convergence

CLC Number: 

  • O224
Trendmd