Alternating proximal gradient method for sparse nonnegative Tucker decomposition

DOI10.1007/s12532-014-0074-yzbMath1320.49019arXiv1302.2559OpenAlexW2073382079MaRDI QIDQ2356334

Yang-yang Xu

Publication date: 29 July 2015

Published in: Mathematical Programming Computation (Search for Journal in Brave)

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

zbMATH Keywords

non-convex optimizationsparse optimizationalternating proximal gradient methodsparse nonnegative Tucker decomposition

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Extrapolation to the limit, deferred corrections (65B05) Decomposition methods (49M27) Numerical methods of relaxation type (49M20) Methods of reduced gradient type (90C52)

Related Items (13)

A globally convergent algorithm for nonconvex optimization based on block coordinate update ⋮ Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection ⋮ Fast nonnegative tensor factorizations with tensor train model ⋮ Correntropy based model predictive controller with multi-constraints for robust path trajectory tracking of self-driving vehicle ⋮ Study of performance of low-rank nonnegative tensor factorization methods ⋮ Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization ⋮ T-product factorization based method for matrix and tensor completion problems ⋮ Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis ⋮ Unsupervised machine learning based on non-negative tensor factorization for analyzing reactive-mixing ⋮ Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis ⋮ Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers ⋮ Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems ⋮ Triple Decomposition and Tensor Recovery of Third Order Tensors

Uses Software

• Matlab
• TensorToolbox
• BCLS

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Sparse non-negative tensor factorization using columnwise coordinate descent
• An alternating direction algorithm for matrix completion with nonnegative factors
• Joint orthomax rotation of the core and component matrices resulting from three-mode principal components analysis
• On semi- and subanalytic geometry
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• Exploiting Symmetry in Tensors for High Performance: Multiplication with Symmetric Tensors
• Algorithms for Sparse Nonnegative Tucker Decompositions
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Learning the parts of objects by non-negative matrix factorization
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Computing non-negative tensor factorizations

This page was built for publication: Alternating proximal gradient method for sparse nonnegative Tucker decomposition