An Implementable First-Order Primal-Dual Algorithm for Structured Convex Optimization

Abstract EN

Many application problems of practical interest can be posed as structured convex optimization models.

In this paper, we study a new first-order primaldual algorithm.

The method can be easily implementable, provided that the resolvent operators of the component objective functions are simple to evaluate.

We show that the proposed method can be interpreted as a proximal point algorithm with a customized metric proximal parameter.

Convergence property is established under the analytic contraction framework.

Finally, we verify the efficiency of the algorithm by solving the stable principal component pursuit problem.