The sparsest solutions to Z-tensor complementarity problems

Abstract

Finding the sparsest solutions to a tensor complementarity problem is generally NP-hard due to the nonconvexity and noncontinuity of the involved ℓ 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 Z-tensor · tensor complementarity problem · sparse solution · exact relaxation · polynomial programming Mathematics Subject Classification (2000) 90C26 · 90C33 · 15A69 · 53A45

Analytical expressions of copositivity for fourth-order symmetric tensors

“…So, we may probe into checking copositivity of tensors and its applications by means of studying this class of semipositive tensors. For its more properties and applications in TCP, see [5,6,9,10,14,15,17,19,30,[46][47][48][51][52][53] and references cited therein.…”

A Continuation Method for Tensor Complementarity Problems

“…When m = 2, the tensor complementarity problems reduce to the well studied linear complementarity problems [7]. When m ≥ 3, they form a nontrivial class of nonlinear complementarity problems, which have received considerable attention recently ( [3,5,4,8,9,11,16,17,21,22,24,25,26,27]). They have found applications in several areas, including nonlinear compressed sensing and game theory ( [17,11]).…”

“…Some algorithms for solving tensor complementarity problems have been proposed recently. Luo, Qi, Xiu [17] proposed a method for finding the sparsest solution to a TCP with a Z-tensor by reformulating the TCP as an equivalent polynomial programming problem. Xie, Li, and Xu [29] proposed an iterative method for finding the least solution to a TCP.…”

Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems

“…The properties of Pareto eigenvalues and their connection to polynomial optimization are studied in [37]. Recently, as a special type of nonlinear complementarity problems, the tensor complementarity problem is inspiring more and more research in the literature [2,6,8,9,13,15,26,38,39,40]. A shifted projected power method for TEiCP was proposed in [9], in which they need an adaptive shift to force the objective to be (locally) convex to guarantee the convergence of power method.…”