In this paper, we study the metric geometric mean introduced by Pusz and Woronowicz spectral Fiedler Pták, originally for positive definite matrices. The relation between t-metric t-spectral is established via log majorization. result then extended in context of symmetric space associated with a noncompact semisimple Lie group. For any Hermitian matrices X Y, So's matrix exponential formula ass...

One of the most popular graph drawing methods is based of achieving graphtheoretic target ditsances. This method was used by Kamada and Kawai [15], who formulated it as an energy optimization problem. Their energy is known in the multidimensional scaling (MDS) community as the stress function. In this work, we show how to draw graphs by stress majorization, adapting a technique known in the MDS...

Zbigniew Puchała, Łukasz Rudnicki, Karol Życzkowski Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, Bałtycka 5, 44-100 Gliwice, Poland Institute of Physics, Jagiellonian University, ul. Reymonta 4, 30-059 Kraków, Poland Center for Theoretical Physics, Polish Academy of Sciences, al. Lotników 32/46, 02-668 Warszawa, Poland Freiburg Insitute for Advanced Studies, Alb...

The adoption of the stress-majorization method from multi-dimensional scaling into graph layout has provided an improved mathematical basis and better convergence properties for so-called “force-directed placement” techniques. In this paper we explore algorithms for augmenting such stress-majorization techniques with simple linear constraints using gradient-projection optimization techniques. O...

In this paper, linear transceiver design for multi-hop amplify-and-forward (AF) multi-input multi-output (MIMO) relaying systems with Gaussian distributed channel estimation errors is investigated. Commonly used transceiver design criteria including weighted mean-square-error (MSE) minimization, capacity maximization, worst-MSE/MAX-MSE minimization and weighted sum-rate maximization, are consid...

A general framework based on majorization, Schur-concavity, and concavity is given that facilitates the analysis of algorithm performance and clarifies the relationships between existing proposed diversity measures useful for best basis selection. Admissible sparsity measures are given by the Schur-concave functions, which are the class of functions consistent with the partial ordering on vecto...