Let ‎X be an ‎‎n-‎‎‎‎‎‎square complex matrix with the ‎Cartesian decomposition ‎‎X = A + i ‎B‎‎‎‎‎, ‎where ‎‎A ‎and ‎‎B ‎are ‎‎‎n ‎‎times n‎ ‎Hermitian ‎matrices. ‎It ‎is ‎known ‎that ‎‎$Vert X Vert_p^2 ‎leq 2(Vert A Vert_p^2 + Vert B Vert_p^2)‎‎‎$, ‎where ‎‎$‎p ‎‎geq 2‎$‎ ‎and ‎‎$‎‎Vert . Vert_p$ ‎is ‎the ‎Schatten ‎‎‎‎p-norm.‎ ‎‎ ‎‎In this paper‎, this inequality and some of its improvements ...

In this paper we address the problem of dynamic MRI reconstruction from partially sampled K-space data. Our work is motivated by previous studies in this area that proposed exploiting the spatiotemporal correlation of the dynamic MRI sequence by posing the reconstruction problem as a least squares minimization regularized by sparsity and low-rank penalties. Ideally the sparsity and low-rank pen...

The asymptotics of the Schatten norms of finite Toeplitz matrices generated by functions with a Fisher-Hartwig singularity are described as the matrix dimension n goes to infinity. The message of the paper is to reveal some kind of a kink: the pth Schatten norm increases as n to the power 1/p before the singularity reaches a critical point and as n to an exponent depending on the singularity be...

The low-rank matrix completion problem is a fundamental machine learning and data mining problem with many important applications. The standard low-rank matrix completion methods relax the rank minimization problem by the trace norm minimization. However, this relaxation may make the solution seriously deviate from the original solution. Meanwhile, most completion methods minimize the squared p...

We inspect the relationship between relative Fourier multipliers on noncommutative Lebesgue-Orlicz spaces of a discrete group Γ and relative Toeplitz-Schur multipliers on Schatten-von-Neumann-Orlicz classes. Four applications are given: lacunary sets, unconditional Schauder bases for the subspace of a Lebesgue space determined by a given spectrum Λ ⊆ Γ , the norm of the Hilbert transform and th...

As an emerging machine learning and information retrieval technique, the matrix completion has been successfully applied to solve many scientific applications, such as collaborative prediction in information retrieval, video completion in computer vision, etc. The matrix completion is to recover a low-rank matrix with a fraction of its entries arbitrarily corrupted. Instead of solving the popul...

In this paper, we fully characterize the duality mapping over space of matrices that are equipped with Schatten norms. Our approach is based on analysis saturation Hölder inequality for We prove in our main result that, p∈(1,∞), real-valued Schatten-p norm a continuous and single-valued function provide an explicit form its computation. For special case p = 1, set-valued; by adding rank constra...