An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem

被引：0
|
作者：
Behrouz Kheirfam
机构：
[1] Azarbaijan Shahid Madani University,Department of Applied Mathematics
来源：
Numerical Algorithms | 2016年 / 71卷
关键词：
Horizontal linear complementarity problem; Infeasible interior-point method; Polynomial complexity; MSC 90C33; MSC 90C51;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present an improved version of an infeasible interior-point method for horizontal linear complementarity problem (J. Optim. Theory Appl.,161(3),853–869, ??2014). In the earlier version, each iteration consisted of one so-called feasibility and a few centering steps. Here, each iteration consists of only a feasibility step, whereas the iteration bound improves the earlier bound.
引用
收藏
页码：491 / 503
页数：12
相关论文
共 50 条
12345