Quasioptimal alternating projections and their use in low-rank approximation of matrices and tensors

Abstract

We study the convergence of specific inexact alternating projections for two non-convex sets in a Euclidean space. The $\sigma$-quasioptimal metric projection ($\sigma \ge 1$) of a point $x$ onto a set $A$ consists of points in $A$ the distance to which is at most $\sigma$ times larger than the minimal distance $\mathrm{dist}(x,A)$. We prove that quasioptimal alternating projections, when one or both projections are quasioptimal, converge locally and linearly for super-regular sets with transversal intersection. The theory is motivated by the successful application of alternating projections to low-rank matrix and tensor approximation. We focus on two problems -- nonnegative low-rank approximation and low-rank approximation in the maximum norm -- and develop fast alternating-projection algorithms for matrices and tensor trains based on cross approximation and acceleration techniques. The numerical experiments confirm that the proposed methods are efficient and suggest that they can be used to regularise various low-rank computational routines.

Accepted for publication in Numerische Mathematik

References in corpus (6)

• Low-rank nonnegative tensor approximation via alternating projections and sketching
• Tensor train completion: local recovery guarantees via Riemannian optimization
• Sketching for low-rank nonnegative matrix approximation: Numerical study
• On the distance to low-rank matrices in the maximum norm
• Nonnegative tensor train for the multicomponent Smoluchowski equation
• Entrywise tensor-train approximation of large tensors via random embeddings