An iterative method for horizontal tensor complementarity problems
From MaRDI portal
Publication:6608757
DOI10.1007/s10957-024-02450-1MaRDI QIDQ6608757
Zheng-Hai Huang, Chen Sun, Yong Wang
Publication date: 20 September 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
tensor equationblock representative tensorhorizontal tensor complementarity problemmonotonically decreasing sequencestrong \(M\)-property
Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Unnamed Item
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- Free boundary problems with nonlinear source terms
- An iterative method for finding the least solution to the tensor complementarity problem
- Splitting methods for a class of horizontal linear complementarity problems
- An inexact Newton method for solving complementarity problems in hydrodynamic lubrication
- The generalized linear complementarity problem and an algorithm to find all its solutions
- Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
- An index detecting algorithm for a class of TCP \((\mathcal{A},q)\) equipped with nonsingular \(\mathcal{M}\)-tensors
- A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems
- A fixed point iterative method for tensor complementarity problems
- Tensor complementarity problems. I: Basic theory
- On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices
- Modulus-based matrix splitting methods for horizontal linear complementarity problems
- Linearized methods for tensor complementarity problems
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- A mixed integer programming approach to the tensor complementarity problem
- \(M\)-tensors and nonsingular \(M\)-tensors
- Eigenvalues of a real supersymmetric tensor
- A homotopy method for solving the horizontal linear complementarity problem
- A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
- Solving tensor complementarity problems with \(Z\)-tensors via a weighted fixed point method
- $M$-Tensors and Some Applications
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Modulus‐based synchronous multisplitting methods for solving horizontal linear complementarity problems on parallel computers
- Finding a Nonnegative Solution to an M-Tensor Equation
- Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities
- A fixed point iterative method for tensor complementarity problems with the implicit \(Z\)-tensors
- A linearized method for solving tensor complementarity problems with implicit \(Z\)-tensors
This page was built for publication: An iterative method for horizontal tensor complementarity problems