A New Constrained Optimization Model for Solving the Nonsymmetric Stochastic Inverse Eigenvalue Problem

by   Gabriele Steidl, et al.

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.


page 1

page 2

page 3

page 4


On a numerical construction of doubly stochastic matrices with prescribed eigenvalues

We study the inverse eigenvalue problem for finding doubly stochastic ma...

Inverse problems for symmetric doubly stochastic matrices whose Suleĭmanova spectra are to be bounded below by 1/2

A new sufficient condition for a list of real numbers to be the spectrum...

Asymptotic and catalytic matrix majorization

The matrix majorization problem asks, given two tuples of probability ve...

Analytical solutions to some generalized matrix eigenvalue problems

We present analytical solutions to two classes of generalized matrix eig...

Rank-1 matrix differential equations for structured eigenvalue optimization

A new approach to solving eigenvalue optimization problems for large str...

Eigenvalue-corrected Natural Gradient Based on a New Approximation

Using second-order optimization methods for training deep neural network...

KrADagrad: Kronecker Approximation-Domination Gradient Preconditioned Stochastic Optimization

Second order stochastic optimizers allow parameter update step size and ...

Please sign up or login with your details

Forgot password? Click here to reset