A mixed integer programming approach to the tensor complementarity problem

The tensor complementarity problem is a special instance of nonlinear complementarity problems, which has many applications. How to solve the tensor complementarity problem, via analyzing the structure of the related tensor, is one of very important research issues. In this paper, we propose a mixed...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of global optimization Ročník 73; číslo 4; s. 789 - 800
Hlavní autori: Du, Shouqiang, Zhang, Liping
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 15.04.2019
Springer
Springer Nature B.V
Predmet:
Computer Science
Integer programming
Mathematical analysis
Mathematics
Mathematics and Statistics
Mixed integer
Operations Research/Decision Theory
Optimization
Real Functions
Tensors
Tensor complementarity problem
Positive definite
Unique solution
Mixed integer programming
15A69
90C11
ISSN:0925-5001, 1573-2916
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The tensor complementarity problem is a special instance of nonlinear complementarity problems, which has many applications. How to solve the tensor complementarity problem, via analyzing the structure of the related tensor, is one of very important research issues. In this paper, we propose a mixed integer programming approach for solving the tensor complementarity problem. We reformulate the tensor complementarity problem as an equivalent mixed integer feasibility problem. Based on the reformulation, some conditions for the solution existence and some solution properties of the tensor complementarity problem are given. We also prove that the tensor complementarity problem, corresponding to a positive definite diagonal tensor, has a unique solution. Finally, numerical results are reported to indicate the efficiency of the proposed algorithm.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-018-00731-4