let a and b be n × m matrices. the matrix b is said to be g-row majorized (respectively g-column majorized) by a, if every row (respectively column) of b, is g-majorized by the corresponding row (respectively column) of a. in this paper all kinds of g-majorization are studied on mn,m, and the possible structure of their linear preservers will be found. also all linear operators t : mn,m ---> mn...

A majorization relating the singular values of an oo-diagonal block of a Hermitian matrix and its eigenvalues is obtained. This basic majorization inequality implies various new and existing results.

let a and b be n × m matrices. the matrix b is said to be g-row majorized (respectively g-column majorized) by a, if every row (respectively column) of b, is g-majorized by the corresponding row (respectively column) of a. in this paper all kinds of g-majorization are studied on mn,m, and the possible structure of their linear preservers will be found. also all linear operators t : mn,m ---> mn...

Let A and B be n × m matrices. The matrix B is said to be g-row majorized (respectively g-column majorized) by A, if every row (respectively column) of B, is g-majorized by the corresponding row (respectively column) of A. In this paper all kinds of g-majorization are studied on Mn,m, and the possible structure of their linear preservers will be found. Also all linear operators T : Mn,m ---> Mn...

This paper considers the problem of constructing a multidimensional Lorenz dominance relation (MLDR) satisfying normatively acceptable conditions. One of the conditions, Comonotonizing Majorization (CM), is a weaker form of the condition of Correlation Increasing Majorizaton considered in the literature on multidimensional inequality indices. A condition, called Prioritization of Attributes und...

A new notion of coneigenvalue was introduced by Ikramov in [Kh.D. Ikramov. On pseudo-eigenvalues and singular numbers of a complex square matrix (in Russian). Zap. Nauchn. Semin. POMI, 334:111–120, 2006.]. This paper presents some majorization inequalities for coneigenvalues, which extend some classical majorization relations for eigenvalues and singular values, and may serve as a basis for fur...

A new notion of coneigenvalue was introduced by Ikramov in [On pseudo-eigenvalues and singular numbers of a complex square matrix, (in Russian), Zap. Nauchn. Semin. POMI 334 (2006), 111-120]. This paper presents some majorization inequalities for coneigenvalues, which extend some classical majorization relations for eigenvalues and singular values, and may serve as a basis for further investiga...

We propose two numerical methods, namely the block relaxation and majorization method, for the problem of nearest correlation matrix with factor structure, which is highly nonconvex. In the block relaxation method, the subproblem is of the standard trust region problem, which is solved by Steighaug’s truncated conjugate gradient method or by the trust region method of [21]. In the majorization ...