scholarly journals Positive Semidefinite Matrix Factorization: A Connection with Phase Retrieval and Affine Rank Minimization

2021 ◽  
pp. 1-1
Author(s):  
Dana Lahat ◽  
Yanbin Lang ◽  
Vincent Y. F. Tan ◽  
Cedric Fevotte
Keyword(s):  
Matrix Factorization ◽  
Phase Retrieval ◽  
Positive Semidefinite ◽  
Positive Semidefinite Matrix ◽  
Rank Minimization ◽  
Semidefinite Matrix

scholarly journals A trace bound for integer-diagonal positive semidefinite matrices

2020 ◽  
Vol 8 (1) ◽  
pp. 14-16
Author(s):  
Lon Mitchell
Keyword(s):  
Positive Semidefinite ◽  
Positive Semidefinite Matrix ◽  
Positive Semidefinite Matrices ◽  
Semidefinite Matrix

AbstractWe 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.

scholarly journals Refined Upper Solution Bound of the Continuous Coupled Algebraic Riccati Equation

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Li Wang
Keyword(s):  
Riccati Equation ◽  
Positive Semidefinite ◽  
Algebraic Riccati Equation ◽  
Positive Semidefinite Matrix ◽  
Matrix Inequalities ◽  
Numerical Examples ◽  
Upper Solution ◽  
Solution Bound ◽  
Semidefinite Matrix ◽  
Two Parameter

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 two-parameter-type upper solution bound of the CCARE. Next, we present an iterative algorithm for finding the tighter upper solution bound of CCARE, prove its boundedness, and analyse its monotonicity and convergence. Finally, corresponding numerical examples are given to illustrate the superiority and effectiveness of the derived results.

scholarly journals A New Algorithm for Positive Semidefinite Matrix Completion

2016 ◽  
Vol 2016 ◽  
pp. 1-5 ◽  
Author(s):  
Fangfang Xu ◽  
Peng Pan
Keyword(s):  
Matrix Completion ◽  
Positive Semidefinite ◽  
Alternating Direction Method ◽  
Low Rank ◽  
System Control ◽  
Positive Semidefinite Matrix ◽  
Linear Least Squares ◽  
Alternating Direction ◽  
Semidefinite Matrix Completion ◽  
Semidefinite Matrix

Positive semidefinite matrix completion (PSDMC) aims to recover positive semidefinite and low-rank matrices from a subset of entries of a matrix. It is widely applicable in many fields, such as statistic analysis and system control. This task can be conducted by solving the nuclear norm regularized linear least squares model with positive semidefinite constraints. We apply the widely used alternating direction method of multipliers to solve the model and get a novel algorithm. The applicability and efficiency of the new algorithm are demonstrated in numerical experiments. Recovery results show that our algorithm is helpful.

Sign in / Sign up

Export Citation Format

Share Document