*Article* **Stable Tensor Principal Component Pursuit: Error Bounds and Efficient Algorithms**

**Wei Fang 1,\*, Dongxu Wei <sup>2</sup> and Ran Zhang <sup>3</sup>**


Received: 13 November 2019; Accepted: 29 November 2019; Published: 3 December 2019

**Abstract:** The rapid development of sensor technology gives rise to the emergence of huge amounts of tensor (i.e., multi-dimensional array) data. For various reasons such as sensor failures and communication loss, the tensor data may be corrupted by not only small noises but also gross corruptions. This paper studies the Stable Tensor Principal Component Pursuit (STPCP) which aims to recover a tensor from its corrupted observations. Specifically, we propose a STPCP model based on the recently proposed tubal nuclear norm (TNN) which has shown superior performance in comparison with other tensor nuclear norms. Theoretically, we rigorously prove that under tensor incoherence conditions, the underlying tensor and the sparse corruption tensor can be stably recovered. Algorithmically, we first develop an ADMM algorithm and then accelerate it by designing a new algorithm based on orthogonal tensor factorization. The superiority and efficiency of the proposed algorithms is demonstrated through experiments on both synthetic and real data sets.

**Keywords:** tensor principal component pursuit; stable recovery; tensor SVD; ADMM
