首页    期刊浏览 2022年08月10日 星期三
登录注册

文章基本信息

  • 标题:A New Full-Newton Step O(n) Infeasible Interior-Point Algorithm for P*(k)-horizontal Linear Complementarity Problems
  • 本地全文:下载
  • 作者:S. Asadi ; H. Mansouri
  • 期刊名称:Computer Science Journal of Moldova
  • 印刷版ISSN:1561-4042
  • 出版年度:2014
  • 卷号:22
  • 期号:1
  • 页码:37-61
  • 出版社:Institute of Mathematics and Computer Science
  • 摘要:In this paper, we first present a brief review about the feasible interior-point algorithm for P*(k)-horizontal linear complementarity problems (HLCPs) based on new directions. Then we present a new infeasible interior-point algorithm for these problems. The algorithm uses two types of full-Newton steps which are called feasibility steps and centering steps. The algorithm starts from strictly feasible iterations of a perturbed problem, and feasibility steps find strictly feasible iterations for the next perturbed problem. By accomplishing a few centering steps for the new perturbed problem, we obtain strictly feasible iterations close enough to the central path of the new perturbed problem and prove that the same result on the order of iteration complexity can be obtained.
  • 关键词:Horizontal linear complementarity problem; infeasible interior-point method; central path.
国家哲学社会科学文献中心版权所有