学术活动

Some new results on tensor complementarity problems

2020-12-04 08:41

报告人: 张立平

报告人单位: 清华大学

时间: 2020-12-15 15:30-16:30

地点: 腾讯会议 ID:724 563 669

开始时间:

报告人简介:

年:

日月:

The tensor complementarity problem (TCP) is a special instance of nonlinear complementarity problems (NCP) which has attracted a lot of study in recent years due to its wide applications. We introduce two novel kinds of structured tensors based on the monotonicity and P-property, respectively. The solvability of the corresponding tensor complementarity problems is discussed. We show that the solution set is nonempty and compact under some mild conditions. These results are true for the TCPs, but not for the NCPs. Based on the structure of the newly introduced tensor, we propose two classes of smoothing Newton-type algorithms for solving the corresponding tensor complementarity problems. The convergence analyses are established and preliminary numerical results show that the proposed algorithms are efficient and very promising.


Contact us

Add:Building 32, The School of Mathematics, Tianjin University Beiyangyuan Campus,

        No. 135, Ya Guan Road, Jinnan District, Tianjin, PRC 

Tel:022-27402850   Mail:math@tju.edu.cn