Abstract
As is well known, the alternating direction method of multipliers (ADMM) is one of the most famous distributed algorithms for solving the convex optimization problems. In this paper, by applying the hierarchical identification principle, we propose an iterative algorithm based on matrix form of ADMM for finding the least squares solution of the generalized Sylvester matrix equation AXB+CXD=E. We prove that the proposed method is convergent under some common conditions for any initial matrices. The simplicity and effectiveness of the new method are shown by the reported numerical results.
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.
