The Complexity of Positive Semidefinite Matrix Factorization [PDF]
SIAM Journal on Optimization, 2017 11 ...
openaire +2 more sources
Positive Semidefinite Matrix Factorization Based on Truncated Wirtinger Flow [PDF]
2020 28th European Signal Processing Conference (EUSIPCO), 2021 This paper deals with algorithms for positive semidefinite matrix factorization (PSDMF). PSDMF is a recently-proposed extension of nonnegative matrix factorization with applications in combinatorial optimization, among others. In this paper, we focus on improving the local convergence of an alternating block gradient (ABC) method for PSDMF in a noise ...
Lahat, Dana, Févotte, Cédric
openaire +2 more sources
On (conditional) positive semidefiniteness in a matrix-valued context [PDF]
Studia Mathematica, 2017 43 pages, replaced Example 4.19 (i) (the original version contained a mistake); journal reference ...
Gesztesy, Fritz, Pang, Michael
openaire +2 more sources
Convergence of block iterative methods for linear systems arising in the numerical solution of Euler equations [PDF]
, 1991 Elsner L, Mehrmann V. Convergence of block iterative methods for linear systems arising in the numerical solution of Euler equations. Numerische Mathematik.
Mehrmann, Volker, Elsner, Ludwig
core +1 more source
A Permanent Inequality for Positive Semidefinite Matrices [PDF]
, 2023 In this paper, we prove an inequality involving the permanent of a positive semidefinite matrix and its leading submatrices.
Paksoy, Vehbi Emrah +2 more
core +1 more source
Singularity Degree of the Positive Semidefinite Matrix Completion Problem [PDF]
SIAM Journal on Optimization, 2017 The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate singularity degree, based on the singularity degree of the positive semidefinite matrix completion problem.
openaire +3 more sources
A trace bound for integer-diagonal positive semidefinite matrices
Special Matrices, 2020 We prove that an n-by-n complex positive semidefinite matrix of rank r whose graph is connected, whose diagonal entries are integers, and whose non-zero off-diagonal entries have modulus at least one, has trace at least n + r − 1.
Mitchell Lon
doaj +1 more source
A time-dependent regularization of the Redfield equation
SciPost Physics, 2023 We introduce a new regularization of the Redfield equation based on a replacement of the Kossakowski matrix with its closest positive semidefinite neighbor.
Antonio D'Abbruzzo, Vasco Cavina, Vittorio Giovannetti
doaj +1 more source
Separability for mixed states with operator Schmidt rank two [PDF]
Quantum, 2019 The operator Schmidt rank is the minimum number of terms required to express a state as a sum of elementary tensor factors. Here we provide a new proof of the fact that any bipartite mixed state with operator Schmidt rank two is separable, and can be ...
Gemma De las Cuevas +2 more
doaj +1 more source
Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint [PDF]
, 2013 18 pages, 3 ...
M. Eisenberg-Nagy (Marianna) +2 more
openaire +4 more sources