DocumentCode :
2248404
Title :
Solving the linear complementarity problem for Stieltjes matrix with interval data
Author :
Yang Chiiansheng
Author_Institution :
Sch. of Math., Zhejiang Ocean Univ., Zhoushan, China
Volume :
6
fYear :
2010
fDate :
11-14 July 2010
Firstpage :
3158
Lastpage :
3163
Abstract :
The linear complementarity problem has many important applications. In this paper, we present an efficient algorithm to solve the linear complementarity problem (LCP) of Stieltjes matrix with interval data. The algorithm has monotonicity property. Cost estate of the algorithm is equivalent to twice calculating of the ordinary without interval data.
Keywords :
linear programming; matrix algebra; quadratic programming; Stieltjes matrix; interval data; linear complementarity problem; monotonicity property; Interval matrix; Linear complementarity problem; Stieltjes matrix;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics (ICMLC), 2010 International Conference on
Conference_Location :
Qingdao
Print_ISBN :
978-1-4244-6526-2
Type :
conf
DOI :
10.1109/ICMLC.2010.5580705
Filename :
5580705
Link To Document :
بازگشت