Tensor completion via minimum and maximum optimization

DOI10.1016/J.CAM.2026.117895MaRDI QIDQ7325553zbMATH OpenFDO

Authors Chuanlong Wang, Jiakun Nan, Xihong Yan

Publication date 8 September 2026

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAM.2026.117895

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26)

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Multilinear Singular Value Decomposition
• A proximal difference-of-convex algorithm with extrapolation
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
• A Singular Value Thresholding Algorithm for Matrix Completion
• Bayesian tensor Tucker completion with a flexible core
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Characterization of the subdifferential of some matrix norms
• Conditions for the equivalence between the low-n-rank tensor recovery problem and its convex relaxation
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
• scientific article; zbMATH DE number 47926 (Why is no real title available?)
• Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
• Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Parallel matrix factorization for low-rank tensor completion
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
• Tensor-train decomposition
• The expression of a tensor or a polyadic as a sum of products.
• Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization

This page was built for publication: Tensor completion via minimum and maximum optimization

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