Abstract
Two new equivalent forms of the matrix nearness problem are developed. Some sufficient and necessary conditions for a symmetric matrix X? being a solution of the considered problem are presented. Based on the new equivalent forms of the above problem and the idea of the alternating direction method with multipliers (ADMM), we establish two new iterative methods to compute its solution, and analyze the global convergence of the proposed algorithms. Numerical results demonstrate the efficiency of our methods. The development here is an extension of the recent work of Peng, Fang, Xiao and Du [<i>SpringerPlus</i>, 5:1005, 2016] on the nearness symmetric solution of the matrix equation <i>AXB</i> = <i>C</i>.
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.
