A New Constrained Optimization Model for Solving the Nonsymmetric Stochastic Inverse Eigenvalue Problem
share
The stochastic inverse eigenvalue problem aims to reconstruct a stochastic matrix from its spectrum. While there exists a large literature on the existence of solutions for special settings, there are only few numerical solution methods available so far. Recently, Zhao et al. (2016) proposed a constrained optimization model on the manifold of so-called isospectral matrices and adapted a modified Polak-Ribière-Polyak conjugate gradient method to the geometry of this manifold. However, not every stochastic matrix is an isospectral one and the model from Zhao et al. is based on the assumption that for each stochastic matrix there exists a (possibly different) isospectral, stochastic matrix with the same spectrum. We are not aware of such a result in the literature, but will see that the claim is at least true for 3 × 3 matrices. In this paper, we suggest to extend the above model by considering matrices which differ from isospectral ones only by multiplication with a block diagonal matrix with 2 × 2 blocks from the special linear group SL(2), where the number of blocks is given by the number of pairs of complex-conjugate eigenvalues. Every stochastic matrix can be written in such a form, which was not the case for the form of the isospectral matrices. We prove that our model has a minimizer and show how the Polak-Ribière-Polyak conjugate gradient method works on the corresponding more general manifold. We demonstrate by numerical examples that the new, more general method performs similarly as the one from Zhao et al.
READ FULL TEXT
