Results 31 to 40 of about 49,656 (213)
On the Burer-Monteiro method for general semidefinite programs
, 2020 Consider a semidefinite program (SDP) involving an $n\times n$ positive semidefinite matrix $X$. The Burer-Monteiro method uses the substitution $X=Y Y^T$ to obtain a nonconvex optimization problem in terms of an $n\times p$ matrix $Y$.
Cifuentes, Diego
core +1 more source
GBD and $ \mathcal{L} $-positive semidefinite elements in $ C^* $-algebras
AIMS MathematicsThis paper focused on the generalized Bott-Duffin (GBD) inverse and the $ {\rm GBD} $ elements in Banach algebra with involution and $ C^* $-algebra, as well as on the property of the $ p $-positive semidefinite elements that are a generalization of the $
Kezheng Zuo +2 more
doaj +1 more source
Real factorization of positive semidefinite matrix polynomials
Linear Algebra and its ApplicationsSuppose $Q(x)$ is a real $n\times n$ regular symmetric positive semidefinite matrix polynomial. Then it can be factored as $$Q(x) = G(x)^TG(x),$$ where $G(x)$ is a real $n\times n$ matrix polynomial with degree half that of $Q(x)$ if and only if $\det(Q(x))$ is the square of a nonzero real polynomial.
Sarah Gift, Hugo J. Woerdeman
openaire +2 more sources
Applied Set-Valued Analysis and Optimization, 2023 We present an algorithm for computing the minimum-rank positive semidefinite completion of a sparse matrix with a chordal sparsity pattern. This problem is tractable, in contrast to the minimum-rank positive semidefinite completion problem for general sparsity patterns.
Jiang, Xin +3 more
openaire +2 more sources
Exposed faces of semidefinitely representable sets
, 2009 A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite.
Netzer, Tim +2 more
core +1 more source
Low-Rank Positive Semidefinite Matrix Recovery From Corrupted Rank-One Measurements
IEEE Transactions on Signal Processing, 2017 12 pages, 7 ...
Li, Yuanxin, Sun, Yue, Chi, Yuejie
openaire +3 more sources
Positive semidefinite solution to matrix completion problem and matrix approximation problem
Filomat, 2022 In this paper, firstly, we discuss the following matrix completion problem in the spectral norm: ?(A B B* X)?2 < 1 subject to (A B B* X) ? 0. The feasible condition for the above problem is established, in this case, the general positive semidefinite solution and its minimum rank are presented.
openaire +1 more source
A quantum-inspired algorithm for estimating the permanent of positive semidefinite matrices
, 2017 We construct a quantum-inspired classical algorithm for computing the permanent of Hermitian positive semidefinite matrices, by exploiting a connection between these mathematical structures and the boson sampling model.
Cerf, N. J. +2 more
core +1 more source
MathematicsThis article proposes a novel robust invariance condition for uncertain linear discrete-time systems with state and control constraints, utilizing a method of semidefinite programming duality.
Hongli Yang +3 more
doaj +1 more source
Refined Upper Solution Bound of the Continuous Coupled Algebraic Riccati Equation
Complexity, 2020 The continuous coupled algebraic Riccati equation (CCARE) has wide applications in control theory and linear systems. In this paper, by a constructed positive semidefinite matrix, matrix inequalities, and matrix eigenvalue inequalities, we propose a new ...
Li Wang
doaj +1 more source