Tensor completion and low-n-rank tensor recovery via convex optimization
From MaRDI portal
Publication:3081493
DOI10.1088/0266-5611/27/2/025010zbMath1211.15036OpenAlexW2078677240MaRDI QIDQ3081493
Isao Yamada, Benjamin Recht, Silvia Gandy
Publication date: 8 March 2011
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0266-5611/27/2/025010
algorithmsconvex optimizationalternating direction methodDouglas-Rachford splittingtensor completionlow-rank tensor recovery problem
Convex programming (90C25) Biomedical imaging and signal processing (92C55) Vector and tensor algebra, theory of invariants (15A72) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Matrix completion problems (15A83)
Related Items
Generative modeling via tree tensor network states, Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists, A new perspective on low-rank optimization, Tensor completion with noisy side information, An accelerated tensorial double proximal gradient method for total variation regularization problem, Tensor completion via multi-directional partial tensor nuclear norm with total variation regularization, Robust low-rank tensor completion via new regularized model with approximate SVD, Riemannian conjugate gradient method for low-rank tensor completion, High-dimensional low-rank tensor autoregressive time series modeling, HTR-CTO algorithm for wireless data recovery, Decomposition of dynamical signals into jumps, oscillatory patterns, and possible outliers, A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion, Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual, Variational Bayesian inference for CP tensor completion with subspace information, An optimal statistical and computational framework for generalized tensor estimation, Nonsingular \(H\)-tensor and its criteria, Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography, Tensor Regression Using Low-Rank and Sparse Tucker Decompositions, Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination, New estimations on the upper bounds for the nuclear norm of a tensor, Adaptive singular value shrinkage estimate for low rank tensor denoising, Variants of Alternating Least Squares Tensor Completion in the Tensor Train Format, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings, Minimum \( n\)-rank approximation via iterative hard thresholding, On the nuclear norm and the singular value decomposition of tensors, Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems, Completely positive tensor recovery with minimal nuclear value, Noisy tensor completion via the sum-of-squares hierarchy, An Adaptive Correction Approach for Tensor Completion, Interpolatory tensorial reduced order models for parametric dynamical systems, Tensor completion via fully-connected tensor network decomposition with regularized factors, Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing, Tensor Completion in Hierarchical Tensor Representations, On tensor completion via nuclear norm minimization, Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems, Tucker factorization with missing data with application to low-\(n\)-rank tensor completion, Quantum machine learning: a classical perspective, Unnamed Item, Low rank tensor recovery via iterative hard thresholding, Nonconvex Low-Rank Tensor Completion from Noisy Data, Convergence rate of Bayesian supervised tensor modeling with multiway shrinkage priors, An inexact continuation accelerated proximal gradient algorithm for lown-rank tensor recovery, An approximation method of CP rank for third-order tensor completion, Iterative methods based on soft thresholding of hierarchical tensors, Continuity, differentiability and semismoothness of generalized tensor functions, Parallel active subspace decomposition for tensor robust principal component analysis, Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms, The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing, Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization, The Geometry of Rank-One Tensor Completion, Low-rank tensor completion by Riemannian optimization, Learning with optimal interpolation norms, $N$-Dimensional Tensor Completion for Nuclear Magnetic Resonance Relaxometry, Matrix factorization for low-rank tensor completion using framelet prior, Tensor factorization using auxiliary information, Characterization of sampling patterns for low-tt-rank tensor retrieval, Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data, T-product factorization based method for matrix and tensor completion problems, Symmetric Tensor Nuclear Norms, Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery, Theoretical and Experimental Analyses of Tensor-Based Regression and Classification, Adaptive total variation and second-order total variation-based model for low-rank tensor completion, Nonconvex optimization for robust tensor completion from grossly sparse observations, Nonconvex tensor rank minimization and its applications to tensor recovery, Cross: efficient low-rank tensor completion, Alternating direction method of multipliers for generalized low-rank tensor recovery, Tensor Completion via Gaussian Process--Based Initialization, Von Neumann's trace inequality for tensors, A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization, Tensor completion using total variation and low-rank matrix factorization, Deterministic Tensor Completion with Hypergraph Expanders, Learning with tensors: a framework based on convex optimization and spectral regularization, Criteria for strong \(H\)-tensors, Iterative adaptive nonconvex low-rank tensor approximation to image restoration based on ADMM, Block tensor train decomposition for missing data estimation, On the subdifferential of symmetric convex functions of the spectrum for symmetric and orthogonally decomposable tensors, Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT), On polynomial time methods for exact low-rank tensor completion, Tensor \(N\)-tubal rank and its convex relaxation for low-rank tensor recovery, Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems, An iterative algorithm for third-order tensor multi-rank minimization, Tensor train rank minimization with nonlocal self-similarity for tensor completion, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, Robust Schatten-\(p\) norm based approach for tensor completion, Matrix completion and tensor rank, A non-convex tensor rank approximation for tensor completion, Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval, Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm, Tensor theta norms and low rank recovery, Iterative algorithm for the symmetric and nonnegative tensor completion problem, Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition, T-product factorization method for internet traffic data completion with spatio-temporal regularization, On the tensor spectral \(p\)-norm and its dual norm via partitions, Low-rank tensor completion via smooth matrix factorization, Low-Rank Approximation and Completion of Positive Tensors, Bounds on the Spectral Norm and the Nuclear Norm of a Tensor Based on Tensor Partitions, A comprehensive and systematic look up into deep learning based object detection techniques: a review, Riemannian Optimization for High-Dimensional Tensor Completion, Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion, Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs, A Splitting Augmented Lagrangian Method for Low Multilinear-Rank Tensor Recovery, Tensor Methods for Nonlinear Matrix Completion, Low-rank tensor completion based on log-det rank approximation and matrix factorization, Low-rank tensor completion using matrix factorization based on tensor train rank and total variation, Stable als approximation in the TT-format for rank-adaptive tensor completion, Nonlocal robust tensor recovery with nonconvex regularization *, An iterative method for tensor inpainting based on higher-order singular value decomposition, Unnamed Item, Unnamed Item, A literature survey of low-rank tensor approximation techniques, Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD, Relations of the nuclear norm of a tensor and its matrix flattenings, Optimization on the hierarchical Tucker manifold - applications to tensor completion, Parallel matrix factorization for low-rank tensor completion
Uses Software
