It is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive deniteness and stability of interval matricescan be presented. These conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.Furthermore we introduce a new necessary and sucient condition for checkingstability of interval...

It is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive deniteness and stability of interval matricescan be presented. These conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.Furthermore we introduce a new necessary and sucient condition for checkingstability of interval...

Matrix completion under interval uncertainty can be cast as a matrix completion problem with element-wise box constraints. We present an efficient alternating-direction parallel coordinate-descent method for the problem. We show that the method outperforms any other known method on a benchmark in image in-painting in terms of signal-to-noise ratio, and that it provides high-quality solutions fo...

Results on the inverse interval matrix, both theoretical and computational, are surveyed. Described are, among others, formulae for the inverse interval matrix, NP-hardness of its computation, various classes of interval matrices for which the inverse can be given explicitly, and closed-form formulae for an enclosure of the inverse.

data envelope analysis (dea) is an approach to estimate the relative efficiency of decision making units (dmus). several studies were conducted in order to prioritize efficient units and some useful models such as cross-efficiency matrix (cem) were presented.  besides, a number of dea models with interval data have been developed and ranking dmus with such data was solved. however, presenting a...

In this paper, we present the notion of complex interval matrix. Further, discuss algebraic structure set all $(m\times n)$ matrices by using tools quasilinear functional analysis. Finally, put a norm on space and calculate matrices.

In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimization problems, such as the k-cluster problem. For the construction of this matrix representation every such graph is associated with a node versus node zero–one matrix. In contrast to representations used in most of t...

Interval programming models for matrix games with interval payoffs Deng-Feng Li a , Jiang-Xia Nan b & Mao-Jun Zhang c a School of Management, Fuzhou University, Fuzhou, 350108, Fujian, People's Republic of China b College of Information Engineering, Dalian University, Dalian, 116622, Liaoning, People's Republic of China c Department of Economics, Dalian University of Technology, Dalian, 116024,...