首页 | 本学科首页   官方微博 | 高级检索  
     检索      

A Potential-Reduction Algorithm for Linear Complementarity Problems
作者姓名:WangYan-jin  FeiPu-sheng  YanZi-zong
作者单位:[1]SchoolofMathematicsandStatistics,WuhanUniversity,Wuhan430072,Hubei,China [2]SchoolofInformationandMathematics,YangtzeUniversity,Jingzhou434100,Hubei,China
基金项目:SupportedbytheNationalNaturalScienceFoundationofChina (70 371 0 32 )andtheDoctoralEducationalFoundationofChinaoftheMinistryofEducation (2 0 0 2 0 4 860 35)
摘    要:Feasible-interior-point algorithms start from a strictly feasible interior point,but infeassible-interior-point algorithms just need to start from an arbitrary positive point.we give a potential reduction algorithm from an infeasible-starting-point for a class of non-monotone linear complementarity problem.Its polynomial complexity is analyzed.After finite iterations the algorithm produces an approximate solution of the problem or shows that there is no feasible optimal solution in a large region.

关 键 词:线性互补问题  内部可行点  多项式复杂性  位势归约算法  线性规划
收稿时间:20 March 2003

A potential-reduction algorithm for linear complementarity problems
WangYan-jin FeiPu-sheng YanZi-zong.A Potential-Reduction Algorithm for Linear Complementarity Problems[J].Wuhan University Journal of Natural Sciences,2004,9(2):144-148.
Authors:Wang Yan-jin  Fei Pu-sheng  Yan Zi-zong
Institution:(1) School of Mathematics and Statistics, Wuhan University, 430072 Wuhan, Hubei, China;(2) School of Information and Mathematics, Yangtze University, 434100 Jingzhou, Hubei, China
Abstract:Feasible-interior-point algorithms start from a strictly feasible interior point, but infeassible-interior-point algorithms just need to start from an arbitrary positive point. we give a potential reduction algorithm from an infeasible-starting-point for a class of non-monotone linear complementarity problem. Its polynomial complexity is analyzed. After finite iterations the algorithm produces an approximate solution of the problem or shows that there is no feasible optimal solution in a large region.
Keywords:linear complementarity problems  infeasible-starting-point  P-matrix  potential function
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号