On Convergence of the Maximum Block Improvement Method
From MaRDI portal
Publication:2954383
DOI10.1137/130939110zbMath1355.65077OpenAlexW2144070955MaRDI QIDQ2954383
Zhening Li, André Uschmajew, Shu-Zhong Zhang
Publication date: 13 January 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://researchportal.port.ac.uk/portal/en/publications/on-convergence-of-the-maximum-block-improvement-method(54a0ae14-8f88-4653-ae9f-958cfada0900).html
convergencenonconvex optimizationŁojasiewicz inequalitynumerical experimentblock coordinate descentmaximum block improvementrank-one tensor approximation
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
Tensor Canonical Correlation Analysis With Convergence and Statistical Guarantees, Scalable Collaborative Ranking for Personalized Prediction, Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality, Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices, A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem, On optimal low rank Tucker approximation for tensors: the case for an adjustable core size, On accelerating the regularized alternating least-squares algorithm for tensors, Multilayer tensor factorization with applications to recommender systems, Markov chain block coordinate descent