Pages that link to "Item:Q2356334"

The following pages link to Alternating proximal gradient method for sparse nonnegative Tucker decomposition (Q2356334):

Displaying 11 items.

• A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
• Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis (Q2205985) (← links)
• Unsupervised machine learning based on non-negative tensor factorization for analyzing reactive-mixing (Q2222331) (← links)
• Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection (Q2416964) (← links)
• Fast nonnegative tensor factorizations with tensor train model (Q2674997) (← links)
• T-product factorization based method for matrix and tensor completion problems (Q2696924) (← links)
• Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers (Q4970264) (← links)
• Correntropy based model predictive controller with multi-constraints for robust path trajectory tracking of self-driving vehicle (Q6113883) (← links)
• Study of performance of low-rank nonnegative tensor factorization methods (Q6116764) (← links)
• Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization (Q6151000) (← links)