Abstract
In this paper, we study the Douglas–Rachford (DR) splitting method when applied to the standard semidefinite programming, and we introduce a new variant of this method and under weak assumptions prove its global convergence. At each iteration, it needs to solve two subproblems. First, project once onto the set of all symmetric positive semidefinite matrices. Then, solve one system of linear equations whose co-efficient matrix is symmetric positive definite. This is in sharp contrast to symmetric positive semi-definiteness of the corresponding co-efficient matrix in the boundary point method recently proposed by Povh et al. More importantly, we analyze the iteration complexity of the DR splitting method and derive the currently best result. Based on rigorous analysis in theory, we suggest an implementable version. Rudimentary numerical experiments confirm its efficiency and robustness on certain test problems with more than one million equality constraints.
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.
