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 条
  • [41] Complexity analysis of a full-Newton step interior-point method for linear optimization
    Zsolt Darvay
    Ingrid-Magdolna Papp
    Petra-Renáta Takács
    Periodica Mathematica Hungarica, 2016, 73 : 27 - 42
  • [42] An Infeasible Interior-point Method for Monotone LCP Based on a Kernel Function With Full-Newton Step
    Kheirfam, B.
    SOUTHEAST ASIAN BULLETIN OF MATHEMATICS, 2016, 40 (05) : 707 - 722
  • [43] Complexity analysis of a full-Newton step interior-point method for linear optimization
    Darvay, Zsolt
    Papp, Ingrid-Magdolna
    Takacs, Petra-Renata
    PERIODICA MATHEMATICA HUNGARICA, 2016, 73 (01) : 27 - 42
  • [44] AN ADAPTIVE PRIMAL-DUAL FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION
    Asadi, Soodabeh
    Mansouri, Hossein
    Zangiabadi, Maryam
    Bulletin of the Korean Mathematical Society, 2016, 53 (06) : 1831 - 1844
  • [45] A FULL-NEWTON STEP FEASIBLE INTERIOR-POINT ALGORITHM BASED ON A SIMPLE KERNEL FUNCTION FOR P∗(k)-HORIZONTAL LINEAR COMPLEMENTARITY PROBLEM
    Zhang, Mingwang
    Zhong, Jiawei
    Wu, Shan
    Zhu, Dechun
    JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS, 2023, 2023
  • [46] AN IMPROVED INFEASIBLE INTERIOR-POINT METHOD FOR SYMMETRIC CONE LINEAR COMPLEMENTARITY PROBLEM
    Kheirfam, B.
    Mahdavi-Amiri, N.
    BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2016, 42 (07) : 55 - 66
  • [47] Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming
    Zhang, Lipu
    Sun, Liming
    Xu, Yinghong
    OPTIMIZATION, 2013, 62 (02) : 169 - 191
  • [48] An infeasible interior-point algorithm with full-Newton steps for P-*(kappa) horizontal linear complementarity problems based on a kernel function
    Asadi, S.
    Zangiabadi, M.
    Mansouri, H.
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2016, 50 (1-2) : 15 - 37
  • [49] Simplified O(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
    Mansouri, H.
    Roos, C.
    OPTIMIZATION METHODS & SOFTWARE, 2007, 22 (03): : 519 - 530
  • [50] Kernel-Based Full-Newton Step Feasible Interior-Point Algorithm for P∗(κ)-Weighted Linear Complementarity Problem
    Chi, Xiaoni
    Wang, Guoqiang
    Lesaja, Goran
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2024, 202 (01) : 108 - 132
12345