Practical proximal primal-dual algorithms for structured saddle point problems Practical proximal primal-dual algorithms for structured saddle point problems

In this paper, we are concerned with a class of convex-concave saddle point problems, where one of the objective parts is assumed to be a convex and smooth function with Lipschitz continuous gradient. By exploiting the bilinear structure of the objective, we first propose a practical accelerated Pro...

Celý popis