DocumentCode
2609772
Title
A Infeasible Interior point homotopy method for solving horizontal linear complementarity problem
Author
Xu, Junyan ; Liu, Qinghuai ; Miao, Zhuang
Author_Institution
Sch. of Basic Sci., Changchun Univ. of Technol. Changchun, Changchun, China
fYear
2011
fDate
27-29 June 2011
Firstpage
30
Lastpage
33
Abstract
A global convergence Infeasible Interior point homotopy method for solving horizontal linear complementarity problem has been introduced in this paper. We give the homotopy equation and prove in details the existence of the smooth path from almost any positive orthant initial point to a solution of HLCP. We give several preliminary numerical results. Numerical results are presented to show the effectiveness of this method.
Keywords
complementarity; convergence; linear programming; HLCP; homotopy method; horizontal linear complementarity problem; infeasible interior point homotopy method; Convergence; Equations; Operations research; Presses; Programming; Vectors; global convergence; homotopy method; infeasible interior point method;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Service System (CSSS), 2011 International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4244-9762-1
Type
conf
DOI
10.1109/CSSS.2011.5974121
Filename
5974121
Link To Document