We propose two approximate versions of the first-order primal-dual algorithm (PDA) to solve a class convex-concave saddle point problems. The introduced criteria are easy implement in sense that they only involve subgradient certain function at current iterate. first PDA solves both subproblems inexactly and adopts absolute error criteria, which based on non-negative summable sequences. Assumin...