Results 121 to 130 of about 6,682,316 (219)
Regularization-Free Estimation in Trace Regression with Symmetric Positive Semidefinite Matrices
, 2015 Trace regression models have received considerable attention in the context of matrix completion, quantum state tomography, and compressed sensing.
Hein, Matthias +5 more
core
Singular value inequalities of matrices via increasing functions
Journal of Inequalities and ApplicationsLet A, B, X, and Y be n × n $n\times n$ complex matrices such that A is self-adjoint, B ≥ 0 $B\geq 0$ , ± A ≤ B $\pm A\leq B$ , max ( ∥ X ∥ 2 , ∥ Y ∥ 2 ) ≤ 1 $\max ( \Vert X \Vert ^{2}, \Vert Y \Vert ^{2} ) \leq 1$ , and let f be a nonnegative increasing
Wasim Audeh +3 more
doaj +1 more source
Lyapunov matrix equations with positive semidefinite input matrices
Electronics Letters, 1968 An algebraic criterion is derived, which establishes whether or not the negative-semidefinite first difference of a quadratic-form Lyapunov function for a linear constant-coefficient difference equation, or the derivative of such a function for a linear constant-coefficient differential equation, can vanish identically along any trajectory of the free ...
openaire +1 more source
A connection between positive semidefinite and euclidean distance matrix completion problems
Linear Algebra and its Applications, 1998 The results obtained for positive semidefinite (PSD) and Euclidean distance (ED) matrix completion problems are very similar. Even though there is a strong relationship between the PSD matrices and ED matrices, it was not clear how to link the two completion problems.
openaire +3 more sources
Monotonicity of positive semidefinite Hermitian matrices
, 1972 Inequalities which compare elements of the convex cone of positive semidefinite hermitian matrices with products of roots of elements are proved. They yield inequalities for Schur functions (generalized matrix functions) which, when specialized to the ...
Stephen Pierce, Russell Merris
core +1 more source
Comparison theorems for the minimum eigenvalue of a random positive-semidefinite matrix
Communications of the American Mathematical SocietyThis paper establishes a new comparison principle for the minimum eigenvalue of a sum of independent random positive-semidefinite matrices. The principle states that the minimum eigenvalue of the matrix sum is controlled by the minimum eigenvalue of a Gaussian random matrix whose statistics are determined by the summands.
openaire +2 more sources
On the Perturbation of Schur Complements in Positive Semidefinite Matrices
, 2007 This note gives perturbation bounds for the Schur complement of a positive definite matrix in a positive semidefinite matrix. This report is available by anonymous ftp from thales.cs.umd.edu in the directory pub/reports.
S C \gamma B +2 more
core
On rank estimation in semidefinite matrices [PDF]
This work concerns the problem of rank estimation in semidefinite matrices, having either indefinite or semidefinite matrix estimator satisfying a typical asymptotic normality condition.
Stephen G. Donald +2 more
core
The Positive Semidefinite Rank of Transportation Polytopes [PDF]
Transportation polytopes have been extensively studied. In this work, we focus on the positive semidefinite rank of transportation polytopes of type 2 × n, where n = 3, 4.
Gerald Sylvester Morgan
core
Semidefinite programming for the educational testing problem
Alternating projections, Educational testing, Non-smooth optimization, Positive semidefinite matrix, Primal–dual interior-point method,
Suliman Al-Homidan
core +1 more source