Home > Papers

 
 
Polynomial Convergence of An Inexact Infeasible Interior Point Algorithm For P-Matrix Linear Complementarity Problems
Yanjin, Wang 1 #,Pusheng, Fei 1,Zizong, Yan 2 *
1.School of Math. and Statistics, Wuhan University, Wuhan, Hubei, 430072, China
2.School of Math. and Statistics- Wuhan University
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:21 June 2004
Accepted by: none
Citation: Yanjin, Wang,Pusheng, Fei,Zizong, Yan.Polynomial Convergence of An Inexact Infeasible Interior Point Algorithm For P-Matrix Linear Complementarity Problems[OL]. [21 June 2004] http://en.paper.edu.cn/en_releasepaper/content/843
 
 
Infeasible starting point methods have been very popular and e®ective for linear program- ming, convex quadratic programming and monotone linear complementarity problems. In this paper, we propose successfully an inexact infeasible-starting-point algorithm for a class of non- monotone linear complementarity problems and prove its polynomial complexity. After ¯nite iterations the algorithm produces an approximate solution of the problem or shows that there is no feasible optimal solution in a large region.
Keywords:Non-monotone linear complementarity problems, infeasible interior point algorithm, P-matrix
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers
  • Other similar papers

Statistics
PDF Downloaded 676
Bookmarked 0
Recommend 5
Comments Array
Submit your papers