A Splitting Augmented Lagrangian Method for Low Multilinear-Rank Tensor Recovery

DOI10.1142/S0217595915400084zbMath1312.94013arXiv1310.1769OpenAlexW2594164693MaRDI QIDQ5245843

Lei Yang, Yu-Fan Li, Zheng-Hai Huang

Publication date: 15 April 2015

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

augmented Lagrangian methodtensor completionlow multilinear-rank tensor recoverymultilinear-rank

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Machine vision and scene understanding (68T45)

Related Items (3)

Continuity, differentiability and semismoothness of generalized tensor functions ⋮ Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms ⋮ Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• An implementable proximal point algorithmic framework for nuclear norm minimization
• Fixed point and Bregman iterative methods for matrix rank minimization
• Null space conditions and thresholds for rank minimization
• The geometry of graphs and some of its algorithmic applications
• Learning with tensors: a framework based on convex optimization and spectral regularization
• A reweighted nuclear norm minimization algorithm for low rank matrix recovery
• Multiplier and gradient methods
• Exact matrix completion via convex optimization
• EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• A Singular Value Thresholding Algorithm for Matrix Completion
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Tensor rank is NP-complete
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• A Fixed Point Iterative Method for Low $n$-Rank Tensor Pursuit
• Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
• Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery

This page was built for publication: A Splitting Augmented Lagrangian Method for Low Multilinear-Rank Tensor Recovery