Alternating iterative methods for solving tensor equations with applications
From MaRDI portal
Publication:1736417
Recommendations
- A proximal point like method for solving tensor least-squares problems
- Alternating projection method for a class of tensor equations
- Iterative algorithms for solving some tensor equations
- The accelerated overrelaxation splitting method for solving symmetric tensor equations
- Splitting methods for tensor equations
Cites work
- scientific article; zbMATH DE number 41266 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A fast algorithm for solving circulant tensor systems
- A homotopy method for solving multilinear systems with M-tensors
- A literature survey of low-rank tensor approximation techniques
- A new scheme for the tensor representation
- A projection method to solve linear systems in tensor format
- An alternating direction algorithm for matrix completion with nonnegative factors
- Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and<?Pub _newline ?>Convergence Analysis
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Eigenvalues of a real supersymmetric tensor
- Exact solutions for the nonlinear Klein–Gordon and Liouville equations in four-dimensional Euclidean space
- Fast solution of parabolic problems in the tensor train/quantized tensor train format with initial application to the Fokker-Planck equation
- Global convergence of ADMM in nonconvex nonsmooth optimization
- HOMO-LUMO maps for chemical graphs
- Hierarchical Singular Value Decomposition of Tensors
- Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming
- Most tensor problems are NP-hard
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Shifted power method for computing tensor eigenpairs
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- Solving sparse non-negative tensor equations: algorithms and applications
- Spectra of uniform hypergraphs
- Splitting methods for tensor equations
- Subspace methods with local refinements for eigenvalue computation using low-rank tensor-train format
- Tensor Decompositions and Applications
- Tensor analysis. Spectral theory and special tensors
- Tensor-train decomposition
- The alternating linear scheme for tensor optimization in the tensor train format
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- The elements of statistical learning. Data mining, inference, and prediction
- The sparsest solutions to \(Z\)-tensor complementarity problems
- The tensor splitting with application to solve multi-linear systems
Cited in
(22)- Iterative algorithms for solving some tensor equations
- A generalized alternating direction method of multipliers for tensor complementarity problems
- Alternating projection method for a class of tensor equations
- The iterative solution of a class of tensor equations via Einstein product with a tensor inequality constraint
- Iterative methods for solving tensor equations based on exponential acceleration
- Gradient based iterative methods for solving symmetric tensor equations
- ITERATIVE ALGORITHMS FOR THE SYMMETRIC AND LEAST-SQUARES SYMMETRIC SOLUTION OF A TENSOR EQUATION
- A nonnegativity preserving algorithm for multilinear systems with nonsingular \(\mathcal{M}\)-tensors
- On HSS-Based Iteration Methods for Two Classes of Tensor Equations
- A new preconditioned SOR method for solving multi-linear systems with an \(\mathcal{M} \)-tensor
- A fast algorithm for solving the tensor product collocation equations
- Iterative methods for sparse symmetric multilinear systems
- Preconditioned AOR iterative methods for solving multi-linear systems with \(\mathcal{M} \)-tensor
- Slice tensor splitting method for solving tensor equation
- A proximal point like method for solving tensor least-squares problems
- Conjugate gradient-like methods for solving general tensor equation with Einstein product
- A two-step accelerated Levenberg-Marquardt method for solving multilinear systems in tensor-train format
- Fourth-order tensor Riccati equations with the Einstein product
- Solving sparse non-negative tensor equations: algorithms and applications
- A new preconditioned AOR-type method for \(\mathcal{M}\)-tensor equation
- Robust Alternating Direction Implicit Solver in Quantized Tensor Formats for a Three-Dimensional Elliptic PDE
- Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method
This page was built for publication: Alternating iterative methods for solving tensor equations with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736417)
