Hypercomplex Tensor Completion via Convex Optimization

DOI10.1109/TSP.2019.2922156MaRDI QIDQ5238959zbMATH OpenWikidataFDO

Authors Takehiko Mizoguchi, Isao Yamada

Publication date 28 October 2019

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

Full work available at URL https://doi.org/10.1109/TSP.2019.2922156

Mathematics Subject Classification ID

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

Cited in

(6)

• Optimization on the hierarchical Tucker manifold - applications to tensor completion
• Near-optimal sample complexity for convex tensor completion
• Multivariate Monotone Inclusions in Saddle Form
• Scaled Coupled Norms and Coupled Higher-Order Tensor Completion
• Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
• The geometry of monotone operator splitting methods

This page was built for publication: Hypercomplex Tensor Completion via Convex Optimization

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