A Matrix Generalization of the Hardy-Littlewood-Pólya Rearrangement Inequality and Its Applications
arXiv:2006.08144
Abstract
By analyzing an optimization problem over orthogonal matrices, we prove a generalization of the Hardy-Littlewood-Pólya rearrangement inequality to positive definite matrices. The inequality is then extended to rectangular matrices. Using our main results, we derive new inequalities for several distance-like functions encountered in various signal processing or machine learning applications.
References in corpus (4)
- Non-Euclidean statistics for covariance matrices, with applications to diffusion tensor imaging
- The closest elastic tensor of arbitrary symmetry to an elasticity tensor of lower symmetry
- Beyond the standard entropic inequalities: stronger scalar separability criteria and their applications
- Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization