ℓp-sphere covering and approximating nuclear p-norm

The spectral p-norm and nuclear p-norm of matrices and tensors appear in various applications albeit both are NP-hard to compute. The former sets a foundation of ℓp-sphere constrained polynomial optimization problems and the latter has been found in many rank minimization problems in machine learning. We study approximation algorithms of the tensor nuclear p-norm with an aim to establish the approximation bound matching the best one of its dual norm, the tensor spectral p-norm.Driven by the application of sphere covering to approximate both tensor spectral and nuclear norms (p=2), we propose several types of hitting sets that approximately represent ℓp-sphere with adjustable parameters for different levels of approximations and cardinalities, providing an independent toolbox for decision making on ℓp-spheres. Using the idea in robust optimization and second-order cone programming, we obtain the first polynomial-time algorithm with an Ω(1)-approximation bound for the computation of the matrix nuclear p-norm when p∈(2,∞) is a rational, paving a way for applications in modeling with the matrix nuclear p-norm. These two new results enable us to propose various polynomial-time approximation algorithms for the computation of the tensor nuclear p-norm using tensor partitions, convex optimization and duality theory, attaining the same approximation bound to the best one of the tensor spectral p-norm. Effective performance of the proposed algorithms for the tensor nuclear p-norm are shown by numerical implementations. We believe the ideas of ℓp-sphere covering with its applications in approximating nuclear p-norm would be useful to tackle optimization problems on other sets such as the binary hypercube with its applications in graph theory and neural networks, the nonnegative sphere with its applications in copositive programming and nonnegative matrix factorization.