English
Related papers

Related papers: Affine-Invariant Midrange Statistics

200 papers

Suppose that $A$ is a nonnegative $n\times m$ real matrix. The NMF problem is the determination of two nonnegative real matrices $F$, $V$ so that $A=FV$ with intermediate dimension $p$ smaller than $min\{ n,m\}$. In this article we present…

Rings and Algebras · Mathematics 2019-06-14 Ioannis A. Polyrakis

Affine matrix rank minimization problem is a fundamental problem with a lot of important applications in many fields. It is well known that this problem is combinatorial and NP-hard in general. In this paper, a continuous promoting low rank…

Optimization and Control · Mathematics 2017-05-02 Angang Cui , Jigen Peng , Haiyang Li , Chengyi Zhang , Yongchao Yu

We develop a natural variant of Dikin's affine-scaling method, first for semidefinite programming and then for hyperbolic programming in general. We match the best complexity bounds known for interior-point methods. All previous…

Optimization and Control · Mathematics 2014-10-27 James Renegar , Mutiara Sondjaja

This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…

Algebraic Geometry · Mathematics 2012-11-16 Maria Isabel Herrero , Gabriela Jeronimo , Juan Sabia

We consider the problem of minimizing a linear function over an affine section of the cone of positive semidefinite matrices, with the additional constraint that the feasible matrix has prescribed rank. When the rank constraint is active,…

Systems and Control · Computer Science 2016-11-22 Simone Naldi

We investigate traces of powers of random matrices whose distributions are invariant under rotations (with respect to the Hilbert--Schmidt inner product) within a real-linear subspace of the space of $n\times n$ matrices. The matrices we…

Probability · Mathematics 2023-11-30 Elizabeth S. Meckes , Mark W. Meckes

When a projection of a symmetric or Hermitian matrix to the positive semidefinite cone is computed approximately (or to working precision on a computer), a natural question is to quantify its accuracy. A straightforward bound invoking…

Numerical Analysis · Mathematics 2019-08-16 Paul J. Goulart , Yuji Nakatsukasa , Nikitas Rontsis

In this paper, we establish several new inequalities for n- time differentiable mappings that are connected with the celebrated Hermite-Hadamard integral inequality.

Functional Analysis · Mathematics 2014-04-22 M. Emin Ozdemir , Cetin Yildiz

We revisit the problem of model-based object recognition for intensity images and attempt to address some of the shortcomings of existing Bayesian methods, such as unsuitable priors and the treatment of residuals with a non-robust error…

Computer Vision and Pattern Recognition · Computer Science 2010-12-14 Vasileios Zografos , Bernard Buxton

This paper studies algorithms for efficiently computing Brascamp-Lieb constants, a task that has recently received much interest. In particular, we reduce the computation to a nonlinear matrix-valued iteration, whose convergence we analyze…

Optimization and Control · Mathematics 2024-04-16 Melanie Weber , Suvrit Sra

We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…

Statistics Theory · Mathematics 2009-06-22 Bernd Sturmfels , Caroline Uhler

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

Symbolic Computation · Computer Science 2020-09-03 Jean-Charles Faugère , George Labahn , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

For given real or complex $m \times n$ data matrices $X$, $Y$, we investigate when there is a matrix $A$ such that $AX = Y$, and $A$ is invertible, Hermitian, positive (semi)definite, unitary, an orthogonal projection, a reflection, complex…

Functional Analysis · Mathematics 2025-04-25 Kyle Bierly , Stephan Ramon Garcia , Roger A. Horn

In this paper we shall study noncommutative central moment inequalities with a main focus on whether the commutative bounds are tight in the noncommutative case, or not. We prove that the answer is affirmative for the fourth central moment…

Functional Analysis · Mathematics 2015-07-10 Zoltan Leka

We answer in the negative a question by Gruenbaum who asked if there exists a finite basis of affine invariant points. We give a positive answer to another question by Gruenbaum about the "size" of the set of all affine invariant points.…

Functional Analysis · Mathematics 2013-01-15 Mathieu Meyer , Carsten Schuett , Elisabeth M. Werner

Intrinsic wavelet transforms and wavelet estimation methods are introduced for curves in the non-Euclidean space of Hermitian positive definite matrices, with in mind the application to Fourier spectral estimation of multivariate stationary…

Methodology · Statistics 2019-11-12 Joris Chau , Rainer von Sachs

The Thompson metric provides key geometric insights in the study or non-linear matrix equations and in many optimization problems. However, knowing that an approximate solution is within d_T units of the actual solution in the Thompson…

Functional Analysis · Mathematics 2016-08-12 David A. Snyder

For a polygon $x=(x_j)_{j\in \mathbb{Z}}$ in $\mathbb{R}^n$ we consider the midpoints polygon $(M(x))_j=\left(x_j+x_{j+1}\right)/2\,.$ We call a polygon a soliton of the midpoints mapping $M$ if its midpoints polygon is the image of the…

Differential Geometry · Mathematics 2020-07-29 Christine Rademacher , Hans-Bert Rademacher

In this paper, we introduce properly-invariant diagonality measures of Hermitian positive-definite matrices. These diagonality measures are defined as distances or divergences between a given positive-definite matrix and its diagonal part.…

Information Theory · Computer Science 2016-09-06 Khaled Alyani , Marco Congedo , Maher Moakher

Let $A$ be an $n \times n$ positive definite Hermitian matrix with all eigenvalues between 1 and 2. We represent the permanent of $A$ as the integral of some explicit log-concave function on ${\Bbb R}^{2n}$. Consequently, there is a fully…

Data Structures and Algorithms · Computer Science 2020-05-14 Alexander Barvinok