Abstract
The proximal partially-parallel splitting method (PPSM), originally proposed in Wang, Desai, and He (2017), is a hybrid mechanism that inherits the nice properties of both Gauss-Seidel and Jacobian substitution procedures for solving the multiple-block convex minimization problem, whose objective function is the sum of m individual (separable) functions without any shared variables, subject to a linear coupling constraint. In this paper, we extend this work and present some linearized versions of the PPSM, which fully utilize the separable structure and result in subproblems that either have closed-form solutions or are relatively easy to solve as compared to their original nonlinear versions. Global convergence of these linearized methods under the projection contraction algorithmic framework is proven, and furthermore, detailed remarks that serve to clarify the interconnections between these linearized variants are highlighted. Finally, the worst-case O(1/t) convergence rate of these methods under ergodic conditions is also established.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
