Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations

Problems of best tensor product approximation of low orthogonal rank can be formulated as maximization problems on Stiefel manifolds. The functionals that appear are convex and weakly sequentially continuous. It is shown that such problems are always well-posed, even in the case of non-compact Stiefel manifolds. As a consequence, problems of finding a best orthogonal, strong orthogonal or complete orthogonal low-rank tensor product approximation and problems of best Tucker format approximation to any given tensor are always well-posed, even in spaces of infinite dimension. (The best rank-one approximation is a special case of all of them.) In addition, the well-posedness of a canonical low-rank approximation with bounded coefficients can be shown. The proofs are non-constructive and the problem of computation is not addressed here.

[1]  Eberhard Zeidler,et al.  Applied Functional Analysis: Main Principles and Their Applications , 1995 .

[2]  M. SIAMJ. A COUNTEREXAMPLE TO THE POSSIBILITY OF AN EXTENSION OF THE ECKART – YOUNG LOW-RANK APPROXIMATION THEOREM FOR THE ORTHOGONAL RANK TENSOR DECOMPOSITION , 2003 .

[3]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[4]  Alan Edelman,et al.  The Geometry of Algorithms with Orthogonality Constraints , 1998, SIAM J. Matrix Anal. Appl..

[5]  Wolfgang Hackbusch,et al.  Tensor product approximation with optimal rank in quantum chemistry. , 2007, The Journal of chemical physics.

[6]  M. Kreĭn,et al.  Introduction to the theory of linear nonselfadjoint operators , 1969 .

[7]  V. Temlyakov Greedy Algorithms andM-Term Approximation with Regard to Redundant Dictionaries , 1999 .

[8]  Joos Vandewalle,et al.  A Multilinear Singular Value Decomposition , 2000, SIAM J. Matrix Anal. Appl..

[9]  Barry Simon,et al.  The Hartree-Fock theory for Coulomb systems , 1977 .

[10]  S. Fomin,et al.  Elements of the Theory of Functions and Functional Analysis , 1961 .

[11]  Gene H. Golub,et al.  Rank-One Approximation to High Order Tensors , 2001, SIAM J. Matrix Anal. Appl..

[12]  Eberhard Zeidler,et al.  Applied Functional Analysis , 1995 .

[13]  W. Greub Linear Algebra , 1981 .

[14]  Boris N. Khoromskij,et al.  Mathematik in den Naturwissenschaften Leipzig Tensor-Product Approximation to Operators and Functions in High Dimensions , 2007 .

[15]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[16]  Tamara G. Kolda,et al.  Orthogonal Tensor Decompositions , 2000, SIAM J. Matrix Anal. Appl..

[17]  Vin de Silva,et al.  Tensor rank and the ill-posedness of the best low-rank approximation problem , 2006, math/0607647.

[18]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[19]  Johan Håstad,et al.  Tensor Rank is NP-Complete , 1989, ICALP.

[20]  A. Balakrishnan Applied Functional Analysis , 1976 .

[21]  Joos Vandewalle,et al.  On the Best Rank-1 and Rank-(R1 , R2, ... , RN) Approximation of Higher-Order Tensors , 2000, SIAM J. Matrix Anal. Appl..

[22]  Claude Le Bris,et al.  A general approach for multiconfiguration methods in quantum molecular chemistry , 1994 .

[23]  J. Weidmann Lineare Operatoren in Hilberträumen , 2000 .