Learnable transform-based nonnegative CP decomposition

DOI10.1007/S10915-025-02976-0MaRDI QIDQ6951351zbMATH OpenFDO

Authors Fukang Li, Hanyu Li

Publication date 29 July 2025

Published in Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10915-025-02976-0

zbMATH Keywords

clusteringcolumn unit constrainthierarchical alternating least squareslearnable semi-orthogonal transformnonnegative CP decompositionproximal alternating minimization

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Numerical optimization and variational techniques (65K10) Learning and adaptive systems in artificial intelligence (68T05)

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
• A Multilinear Singular Value Decomposition
• A new truncation strategy for the higher-order singular value decomposition
• An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints
• Clarke Subgradients of Stratifiable Functions
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• scientific article; zbMATH DE number 3477343 (Why is no real title available?)
• Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
• Learning From Hidden Traits: Joint Factor Analysis and Latent Clustering
• Learning the parts of objects by non-negative matrix factorization
• Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
• NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
• Nonnegative matrix factorization
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

This page was built for publication: Learnable transform-based nonnegative CP decomposition

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