Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations
From MaRDI portal
Publication:967579
DOI10.1007/s00211-009-0276-9zbMath1192.65086MaRDI QIDQ967579
Publication date: 30 April 2010
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-009-0276-9
low-rank approximation; convex maximization; tensor product approximation; Stiefel manifolds; Tucker approximation
Related Items
The geometry of algorithms using hierarchical tensors, Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces, Regularity of tensor product approximations to square integrable functions, On minimal subspaces in tensor representations, Musings on multilinear fitting, Variational calculus with sums of elementary tensors of fixed rank
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
- Applied functional analysis. Main principles and their applications
- A general approach for multiconfiguration methods in quantum molecular chemistry
- Tensor-product approximation to operators and functions in high dimensions
- Orthogonal Tensor Decompositions
- Rank-One Approximation to High Order Tensors
- Tensor rank is NP-complete
- The Geometry of Algorithms with Orthogonality Constraints
- A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Multilinear Algebra
