Searcharxiv⌕ Search

arXiv subjects

Gaohang Yu

Publications and source records attributed to Gaohang Yu.

21 records · Page 2Linked to original sources

Properties of Solution set of Tensor Complementarity Problem

The tensor complementarity problem is a specially structured nonlinear complementarity problem, then it has its particular and nice properties other than ones of the classical nonlinear complementarity problem. In this paper, it is proved that a tensor is an S-tensor if and only if the tensor complementarity problem is feasible, and each Q-tensor is an S-tensor. Furthermore, the boundedness of solution set of the tensor complementarity problem is equivalent to the uniqueness of solution for such a problem with zero vector. For the tensor complementarity problem with a strictly semi-positive tensor, we proved the global upper bounds for solution of such a problem. In particular, the upper bounds keep in close contact with the smallest Pareto $H-$($Z-$)eigenvalue.

math.OC↗

Spectral projected gradient methods for generalized tensor eigenvalue complementarity problem

This paper looks at the tensor eigenvalue complementarity problem (TEiCP) which arises from the stability analysis of finite dimensional mechanical systems and is closely related to the optimality conditions for polynomial optimization. We investigate two monotone ascent spectral projected gradient (SPG) methods for TEiCP. We also present a shifted scaling-and-projection algorithm (SPA), which is a great improvement of the original SPA method proposed by Ling, He and Qi [Comput. Optim. Appl., DOI 10.1007/s10589-015-9767-z]. Numerical comparisons with some existed gradient methods in the literature are reported to illustrate the efficiency of the proposed methods.

math.OC↗

An adaptive gradient method for computing generalized tensor eigenpairs

High order tensor arises more and more often in signal processing,data analysis, higher-order statistics, as well as imaging sciences. In this paper, an adaptive gradient (AG) method is presented for generalized tensor eigenpairs. Global convergence and linear convergence rate are established under some suitable conditions. Numerical results are reported to illustrate the efficiency of the proposed method. Comparing with the GEAP method, an adaptive shifted power method proposed by Tamara G. Kolda and Jackson R. Mayo [SIAM J. Matrix Anal. Appl., 35 (2014), pp. 1563-1581], the AG method is much faster and could reach the largest eigenpair with a higher probability.

math.OC↗