scientific article; zbMATH DE number 7409363

zbMath1488.37082MaRDI QIDQ5155916

Balázs Bárány, Martin J. Mohlenkamp, Todd R. Young

Publication date: 13 October 2021

Full work available at URL: http://www.math.ualberta.ca/ijnam/Volume-17-2020/No-4-20/2020-04-06.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

swampblock coordinate descentalternating least squarestensor approximationdiagonal valley

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Dynamical systems in numerical analysis (37N30)

Uses Software

• Multilinear Engine

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of algorithms for fitting the PARAFAC model
• Principal component analysis of three-mode data by means of alternating least squares algorithms
• On the convergence of the coordinate descent method for convex differentiable minimization
• Accelerating optimization by tracing valley
• Some convergence results on the regularized alternating least-squares method for tensor decomposition
• Musings on multilinear fitting
• Variational calculus with sums of elementary tensors of fixed rank
• Linear and nonlinear programming
• Efficient block-coordinate descent algorithms for the group Lasso
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• Randomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random Data
• Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
• A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• Maximum Block Improvement and Polynomial Optimization
• A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
• A new convergence proof for the higher-order power method and generalizations
• A Decomposition for Three-Way Arrays
• The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor
• A nonlinearly preconditioned conjugate gradient algorithm for rank‐R canonical tensor approximation
• Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
• Numerical operator calculus in higher dimensions
• The Dynamics of Swamps in the Canonical Tensor Approximation Problem
• Enhanced Line Search: A Novel Method to Accelerate PARAFAC
• Minimizing Certain Convex Functions
• Function minimization by conjugate gradients
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• On the Convergence of Block Coordinate Descent Type Methods
• Algorithms for Numerical Analysis in High Dimensions
• Convergence of a block coordinate descent method for nondifferentiable minimization
• Exact line and plane search for tensor optimization

This page was built for publication: