A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization

DOI10.1109/TSP.2016.2576427zbMath1414.94253arXiv1506.04209MaRDI QIDQ4620959

Kejun Huang, Nicholas D. Sidiropoulos, A. P. Liavas

Publication date: 8 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (13)

A survey on deep matrix factorizations ⋮ Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint ⋮ Tutorial on Amortized Optimization ⋮ Exploiting Efficient Representations in Large-Scale Tensor Decompositions ⋮ Hyperspectral image classification based on mathematical morphology and tensor decomposition ⋮ Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications ⋮ Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence ⋮ Best Nonnegative Rank-One Approximations of Tensors ⋮ Generalized Canonical Polyadic Tensor Decomposition ⋮ Time-homogeneous top-K ranking using tensor decompositions ⋮ Dynamical Variational Autoencoders: A Comprehensive Review ⋮ An AO-ADMM Approach to Constraining PARAFAC2 on All Modes ⋮ Hyperspectral Super-resolution Accounting for Spectral Variability: Coupled Tensor LL1-Based Recovery and Blind Unmixing of the Unknown Super-resolution Image

This page was built for publication: A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization