Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers

DOI10.1109/TSP.2015.2454476zbMath1394.94321arXiv1409.2383MaRDI QIDQ4580860

Nicholas D. Sidiropoulos, A. P. Liavas

Publication date: 22 August 2018

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

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

Mathematics Subject Classification ID

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

Related Items (15)

A primal-dual algorithm for nonnegative \(N\)-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis ⋮ Dynamic behavior analysis via structured rank minimization ⋮ Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization ⋮ An Alternating Augmented Lagrangian method for constrained nonconvex optimization ⋮ Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery ⋮ Bregman reweighted alternating minimization and its application to image deblurring ⋮ Exploiting Efficient Representations in Large-Scale Tensor Decompositions ⋮ Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property ⋮ Alternating iterative methods for solving tensor equations with applications ⋮ Global convergence of ADMM in nonconvex nonsmooth optimization ⋮ A general system for heuristic minimization of convex functions over non-convex sets ⋮ A simple effective heuristic for embedded mixed-integer quadratic programming ⋮ A TT-Based Hierarchical Framework for Decomposing High-Order Tensors ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints

This page was built for publication: Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers