Two-step fixed-point proximity algorithms for multi-block separable convex problems (Q2356610): Difference between revisions

The authors develop convergent and computationally efficient algorithms for solving multi-block separable convex optimization problems. Moreover, specific two-step fixed-point proximity algorithms from the proposed iterative schemes are derived and their global convergence is established. Numerical experiments demonstrate the numerical efficiency of the proposed algorithms.