On the convergence of higher-order orthogonal iteration

DOI10.1080/03081087.2017.1391743zbMath1401.90176arXiv1504.00538OpenAlexW2963588627MaRDI QIDQ4685516

Yang-yang Xu

Publication date: 9 October 2018

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.00538

zbMATH Keywords

global convergencegreedy algorithmblock coordinate descenthigher-order orthogonal iteration (HOOI)Kurdyka-Jasiewicz (KL) property

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Efficient alternating least squares algorithms for low multilinear rank approximation of tensors ⋮ On global convergence of alternating least squares for tensor approximation ⋮ Unnamed Item

Uses Software

• TensorToolbox
• Tensorlab

Cites Work

• Unnamed Item
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• A survey of multilinear subspace learning for tensor data
• Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors
• Principal component analysis of three-mode data by means of alternating least squares algorithms
• A trace inequality of John von Neumann
• On gradients of functions definable in o-minimal structures
• On semi- and subanalytic geometry
• Computational aspects of F. L. Bauer's simultaneous iteration method
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• On the Global Convergence of the Alternating Least Squares Method for Rank-One Approximation to Generic Tensors
• A new convergence proof for the higher-order power method and generalizations
• Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Perturbation Theory and Optimality Conditions for the Best Multilinear Rank Approximation of a Tensor
• A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

This page was built for publication: On the convergence of higher-order orthogonal iteration