An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints

DOI10.1007/S10589-024-00574-8MaRDI QIDQ6568930zbMATH OpenFDO

Authors Zihao Wang, Minru Bai

Publication date 8 July 2024

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10589-024-00574-8

zbMATH Keywords

accelerated block coordinate descentcolumn unit constraintcomponent separationinexact algorithmnonnegative CANDECOMP/PARAFAC decomposition

Mathematics Subject Classification ID

Nonlinear programming (90C30) Applications of mathematical programming (90C90)

Recommendations

• A primal-dual algorithm for nonnegative N-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis
• A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search.
• A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
• Accelerating block coordinate descent for nonnegative tensor factorization
• Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization

Cites work

• A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Convex optimization theory.
• Lectures on convex optimization
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Tensor Decompositions and Applications

Cited in

(3)

• Learnable transform-based nonnegative CP decomposition
• Group sparse-based tensor CP decomposition: model, algorithm, and applications in chemometrics
• An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs

This page was built for publication: An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568930)