Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation
From MaRDI portal
Publication:6038829
DOI10.1007/s10444-023-10014-6zbMath1518.90086arXiv2005.00998MaRDI QIDQ6038829
Publication date: 3 May 2023
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.00998
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Best approximation, Chebyshev systems (41A50) Multilinear algebra, tensor calculus (15A69) Robustness in mathematical programming (90C17)
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Cauchy noise removal by nonconvex ADMM with convergence guarantees
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Cauchy noise removal by weighted nuclear norm minimization
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Cauchy noise removal using group-based low-rank prior
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Robust Low-Rank Tensor Recovery: Models and Algorithms
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Globally Convergent Jacobi-Type Algorithms for Simultaneous Orthogonal Symmetric Tensor Diagonalization
- Orthogonal Low Rank Tensor Approximation: Alternating Least Squares Method and Its Global Convergence
- Variational Approach for Restoring Blurred Images with Cauchy Noise
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors
- Robust regression using iteratively reweighted least-squares
- A Multilinear Singular Value Decomposition
- Symmetric orthogonal approximation to symmetric tensors with applications to image reconstruction
- Probabilistic Tensor Canonical Polyadic Decomposition With Orthogonal Factors
- Tensor Decomposition for Signal Processing and Machine Learning
- The Fitting of Power Series, Meaning Polynomials, Illustrated on Band-Spectroscopic Data
- Canonical Polyadic Decomposition with a Columnwise Orthonormal Factor Matrix
- A Statistical Learning Approach to Modal Regression
- The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence
- Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
- Generalized Canonical Polyadic Tensor Decomposition
- Numerical Computation for Orthogonal Low-Rank Approximation of Tensors
- Most Tensor Problems Are NP-Hard
This page was built for publication: Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation
