scholarly journals A New Algorithm for Positive Semidefinite Matrix Completion

2016 ◽  
Vol 2016 ◽  
pp. 1-5 ◽  
Author(s):  
Fangfang Xu ◽  
Peng Pan

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.

Author(s):  
Aarab Mohamed Nassim ◽  
Chakkor Otman

With the explosive growth in demand for mobile data traffic, the contradiction between capacity requirements and spectrum scarcity becomes more and more prominent. The bandwidth is becoming a key issue in 5G mobile networks. However, with the huge bandwidth from 30 GHz to 300 GHz, mmWave communications considered an important part of the 5G mobile network providing multi communication services, where channel state information considers a challenging task for millimeter wave MIMO systems due to the huge number of antennas. Therefore, this paper discusses the channel and signal models of the mmWave, with a novel formulation for mmWave channel estimation inclusive low rank features, that we improved using a developed theory of matrix completion with Alternating Direction Method.


2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Minghua Xu ◽  
Yong Zhang ◽  
Qinglong Huang ◽  
Zhenhua Yang

We consider the problem of seeking a symmetric positive semidefinite matrix in a closed convex set to approximate a given matrix. This problem may arise in several areas of numerical linear algebra or come from finance industry or statistics and thus has many applications. For solving this class of matrix optimization problems, many methods have been proposed in the literature. The proximal alternating direction method is one of those methods which can be easily applied to solve these matrix optimization problems. Generally, the proximal parameters of the proximal alternating direction method are greater than zero. In this paper, we conclude that the restriction on the proximal parameters can be relaxed for solving this kind of matrix optimization problems. Numerical experiments also show that the proximal alternating direction method with the relaxed proximal parameters is convergent and generally has a better performance than the classical proximal alternating direction method.


2020 ◽  
Vol 8 (1) ◽  
pp. 14-16
Author(s):  
Lon Mitchell

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.


Sign in / Sign up

Export Citation Format

Share Document