The Sparse Solution to \mathcal{KS}-Tensor Complementarity Problems
From MaRDI portal
Publication:6408869
arXiv2208.12444MaRDI QIDQ6408869FDOQ6408869
Authors: Jingjing Sun, Shouqiang Du, Yuanyuan Chen, Yimin Wei 
Publication date: 26 August 2022
Abstract: In view of the KS-tensor complementarity problem, the sparse solution of this problem is studied. Due to the nonconvexity and noncontinuity of the l_0-norm, it is a NP hard problem to find the sparse solution of the KS-tensor complementarity problem. In order to solve this problem, we transform it into a polynomial programming problem with constraints. Then we use the sequential quadratic programming (SQP) algorithm to solve this transformed problem. Numerical results show that the SQP algorithm can find the sparse solutions of the KS-tensor complementarity problem effectively.
Multilinear algebra, tensor calculus (15A69) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
This page was built for publication: The Sparse Solution to $\mathcal{KS}$-Tensor Complementarity Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6408869)
