The sparsest solutions to <Emphasis Type="Italic">Z</Emphasis>-tensor complementarity problems |
| |
Authors: | Ziyan Luo Liqun Qi Naihua Xiu |
| |
Institution: | 1.State Key Laboratory of Rail Traffic Control and Safety,Beijing Jiaotong University,Beijing,China;2.Department of Applied Mathematics,The Hong Kong Polytechnic University,Hong Kong,China;3.Department of Mathematics, School of Science,Beijing Jiaotong University,Beijing,China |
| |
Abstract: | Finding the sparsest solutions to a tensor complementarity problem is generally NP-hard due to the nonconvexity and noncontinuity of the involved \(\ell _0\) norm. In this paper, a special type of tensor complementarity problems with Z-tensors has been considered. Under some mild conditions, we show that to pursuit the sparsest solutions is equivalent to solving polynomial programming with a linear objective function. The involved conditions guarantee the desired exact relaxation and also allow to achieve a global optimal solution to the relaxed nonconvex polynomial programming problem. Particularly, in comparison to existing exact relaxation conditions, such as RIP-type ones, our proposed conditions are easy to verify. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|