An iterative method for finding the least solution to the tensor complementarity problem

DOI10.1007/s10957-017-1157-5zbMath1375.90291OpenAlexW2747026371MaRDI QIDQ1682973

Shui-Lian Xie, Hong-Ru Xu, Dong-hui Li

Publication date: 6 December 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-017-1157-5

zbMATH Keywords

monotone convergencesparsest solutiontensor complementarity problem\(Z\)-tensorleast solution

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Vector and tensor algebra, theory of invariants (15A72) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)

Related Items (36)

Randomized Kaczmarz methods for tensor complementarity problems ⋮ A new smoothing spectral conjugate gradient method for solving tensor complementarity problems ⋮ Accelerated dynamical approaches for finding the unique positive solution of \(\mathcal{KS}\)-tensor equations ⋮ Global uniqueness and solvability of tensor complementarity problems for \(\mathcal{H}_+\)-tensors ⋮ Stochastic \(R_0\) tensors to stochastic tensor complementarity problems ⋮ A smoothing projected HS method for solving stochastic tensor complementarity problem ⋮ Solution set bounds for LCPs over tensor spaces ⋮ On the R0-tensors and the solution map of tensor complementarity problems ⋮ Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities ⋮ A mixed integer programming approach to the tensor complementarity problem ⋮ A fixed point iterative method for tensor complementarity problems with the implicit \(Z\)-tensors ⋮ Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem ⋮ A general preconditioner for tensor complementarity problems ⋮ A fixed point iterative method for tensor complementarity problems ⋮ Solving tensor complementarity problems with \(Z\)-tensors via a weighted fixed point method ⋮ Stability of Solutions and Continuity of Solution Maps of Tensor Complementarity Problems ⋮ A continuation method for tensor complementarity problems ⋮ Bounds of the solution set of the tensor complementarity problem ⋮ Generalized Tensor Complementarity Problems Over a Polyhedral Cone ⋮ An alternating direction method of multipliers for tensor complementarity problems ⋮ Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem ⋮ Tensor complementarity problems. II: Solution methods ⋮ Generalized tensor equations with leading structured tensors ⋮ An index detecting algorithm for a class of TCP \((\mathcal{A},q)\) equipped with nonsingular \(\mathcal{M}\)-tensors ⋮ A lower dimensional linear equation approach to the m-tensor complementarity problem ⋮ A modified LM algorithm for tensor complementarity problems over the circular cone ⋮ Modified gradient dynamic approach to the tensor complementarity problem ⋮ Solvability of two classes of tensor complementarity problems ⋮ Linearized methods for tensor complementarity problems ⋮ Stochastic structured tensors to stochastic complementarity problems ⋮ A potential reduction method for tensor complementarity problems ⋮ Estimations on upper and lower bounds of solutions to a class of tensor complementarity problems ⋮ Weakening convergence conditions of a potential reduction method for tensor complementarity problems ⋮ A two-level additive Schwarz method for a kind of tensor complementarity problem ⋮ The GUS-property and modulus-based methods for tensor complementarity problems ⋮ Stochastic tensor complementarity problem with discrete distribution

Cites Work

• Positive-definite tensors to nonlinear complementarity problems
• Global uniqueness and solvability for tensor complementarity problems
• Properties of solution set of tensor complementarity problem
• The sparsest solutions to \(Z\)-tensor complementarity problems
• Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
• Some properties of strong \(\mathcal{H}\)-tensors and general \(\mathcal{H}\)-tensors
• Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
• Properties of some classes of structured tensors
• Solving multi-linear systems with \(\mathcal {M}\)-tensors
• \(M\)-tensors and nonsingular \(M\)-tensors
• Eigenvalues of a real supersymmetric tensor
• Exceptionally regular tensors and tensor complementarity problems
• Sparse Signal Recovery from Quadratic Measurements via Convex Programming
• $M$-Tensors and Some Applications
• The Linear Complementarity Problem
• On $Q$-Tensors

This page was built for publication: An iterative method for finding the least solution to the tensor complementarity problem