An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
提出一种新的加速算法求解复合凸凹鞍点问题，该算法是混合近端外梯度框架的特例，使用Nesterov加速变体近似求解近端子问题，具有最优的迭代复杂度，且不要求可行域有界，实验表明优于Nesterov平滑技术。
This paper proposes a new algorithm for solving a class of composite convex-concave saddle-point problems. The new algorithm is a special instance of the hybrid proximal extragradient framework in which a Nesterov accelerated variant is used to approximately solve the prox subproblems. One of the advantages of the new method is that it works for any constant choice of proximal stepsize. Moreover, a suitable choice of the latter stepsize yields a method with the best known (accelerated inner) iteration complexity for the aforementioned class of saddle-point problems. In contrast to the smoothing technique of [Y. Nesterov, Math. Program., 103 (2005), pp. 127--152], our accelerated method does not assume that a feasible set is bounded due to its proximal point nature. Experiment results on three problem sets show that the new method outperforms Nesterov's smoothing technique of [Y. Nesterov, Math. Program., 103 (2005), pp. 127--152].