On the non-symmetric semidefinite Procrustes problem

From MaRDI portal
Publication:2144240

DOI10.1016/J.LAA.2022.04.001zbMATH Open1492.65159arXiv2104.06201OpenAlexW3152590761MaRDI QIDQ2144240FDOQ2144240


Authors: Mohit Kumar Baghel, Nicolas Gillis, Punit Sharma Edit this on Wikidata


Publication date: 1 June 2022

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: In this paper, we consider the non-symmetric positive semidefinite Procrustes (NSPSDP) problem: Given two matrices X,YinmathbbRn,m, find the matrix AinmathbbRn,n that minimizes the Frobenius norm of AXY and which is such that A+AT is positive semidefinite. We generalize the semi-analytical approach for the symmetric positive semidefinite Procrustes problem, where A is required to be positive semidefinite, that was proposed by Gillis and Sharma (A semi-analytical approach for the positive semidefinite Procrustes problem, Linear Algebra Appl. 540, 112-137, 2018). As for the symmetric case, we first show that the NSPSDP problem can be reduced to a smaller NSPSDP problem that always has a unique solution and where the matrix X is diagonal and has full rank. Then, an efficient semi-analytical algorithm to solve the NSPSDP problem is proposed, solving the smaller and well-posed problem with a fast gradient method which guarantees a linear rate of convergence. This algorithm is also applicable to solve the complex NSPSDP problem, where X,YinmathbbCn,m, as we show the complex NSPSDP problem can be written as an overparametrized real NSPSDP problem. The efficiency of the proposed algorithm is illustrated on several numerical examples.


Full work available at URL: https://arxiv.org/abs/2104.06201




Recommendations




Cites Work


Cited In (9)

Uses Software





This page was built for publication: On the non-symmetric semidefinite Procrustes problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144240)