A line-search-based partial proximal alternating directions method for separable convex optimization

We propose an appealing line-search-based partial proximal alternating directions (lsppad) method for solving a class of separable convex optimization problems. these problems under consideration are common in practice. the proposed method solves two subproblems at each iteration: one is solved by a proximal point method,while the proximal term is absent from the other. both subproblems admit inexact solutions. a line search technique is used to guarantee the convergence. the convergence of the lsppad method is established under some suitable conditions. the advantage of the proposed method is that it provides the tractability of the subproblem in which the proximal term is absent. numerical tests show that the lsppad method has better performance compared with the existing alternating projection based prediction-correction (apbpc) method if both are employed to solve the described problem. © 2014 yu-hua zeng et al.