Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms
type: Item
instance of: scholarly article
title: Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms
zbMATH Open document ID: 1377.65066
author: Yu-Fan Li
author: Kun Shang
author: Zhenghai Huang
published in: Journal of Computational and Applied Mathematics
publication date: 2017-11-14T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6806866
zbMATH Keywords: low Tucker rank tensor recovery
zbMATH Keywords: tensor completion
zbMATH Keywords: alternative direction method of multipliers
zbMATH Keywords: iteratively reweighted algorithms
zbMATH Keywords: \(L_p\) norm
zbMATH Keywords: non-convex minimization problem
zbMATH Keywords: numerical experiment
MaRDI profile type: Publication
full work available at URL: j.cam.2017.09.029
OpenAlex ID: W2763810251
cites work: Tensor Decompositions and Applications
cites work: Exact matrix completion via convex optimization
cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion
cites work: Tensor completion and low-n-rank tensor recovery via convex optimization
cites work: Learning with tensors: a framework based on convex optimization and spectral regularization
cites work: A Fixed Point Iterative Method for Low $n$-Rank Tensor Pursuit
cites work: Parallel matrix factorization for low-rank tensor completion
cites work: A Splitting Augmented Lagrangian Method for Low Multilinear-Rank Tensor Recovery
cites work: An Adaptive Correction Approach for Tensor Completion
cites work: Q2941675
cites work: A reweighted nuclear norm minimization algorithm for low rank matrix recovery
cites work: Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
cites work: Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
cites work: Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
cites work: Global Convergence of Splitting Methods for Nonconvex Composite Optimization
cites work: Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
cites work: Q5728711
DOI: 10.1016/J.CAM.2017.09.029
description: scientific article; zbMATH DE number 6806866