Interior-point algorithm for linear optimization based on a new trigonometric kernel function

被引：31
作者：
Li, Xin [1 ]
Zhang, Mingwang [1 ]
机构：
[1] China Three Gorges Univ, Coll Sci, Yi Chang 443002, Peoples R China
来源：
OPERATIONS RESEARCH LETTERS | 2015年 / 43卷 / 05期
关键词：
Linear optimization; Kernel function; Interior-point algorithm; Large-update; Polynomial complexity;
D O I：
10.1016/j.orl.2015.06.013
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we present a new primal-dual interior-point algorithm for linear optimization based on a trigonometric kernel function. By simple analysis, we derive the worst case complexity for a large-update primal-dual interior-point method based on this kernel function. This complexity estimate improves a result from El Ghami et al. (2012) and matches the one obtained in Reza Peza Peyghami et al. (2014). (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：471 / 475
页数：5
相关论文
共 50 条
  • [21] AN INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION BASED ON A NEW ALGEBRAICALLY EQUIVALENT TRANSFORMATION
    Anane, Nassima
    Khaldi, Merzaka
    Achache, Mohamed
    Applied Set-Valued Analysis and Optimization, 2025, 7 (01): : 111 - 124
  • [22] ANALYSIS OF COMPLEXITY OF PRIMAL-DUAL INTERIOR-POINT ALGORITHMS BASED ON A NEW KERNEL FUNCTION FOR LINEAR OPTIMIZATION
    Li, Siqi
    Qian, Weiyi
    NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2015, 5 (01): : 37 - 46
  • [23] Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function
    Amini, K.
    Peyghami, M. R.
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 176 (01) : 194 - 207
  • [24] Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
    Moslemi, M.
    Kheirfam, B.
    OPTIMIZATION LETTERS, 2019, 13 (01) : 127 - 145
  • [25] Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
    M. Moslemi
    B. Kheirfam
    Optimization Letters, 2019, 13 : 127 - 145
  • [26] A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
    Kheirfam, B.
    Haghighi, M.
    OPTIMIZATION, 2016, 65 (04) : 841 - 857
  • [27] Interior-point algorithm based on general kernel function for monotone linear complementarity problem
    刘勇
    白延琴
    Advances in Manufacturing, 2009, (02) : 95 - 101
  • [28] A new infeasible interior-point algorithm with full-Newton steps for linear programming based on a kernel function
    Zhang M.
    Geng J.
    Wu S.
    Journal of Nonlinear Functional Analysis, 2021, 2021
  • [29] PRIMAL-DUAL INTERIOR-POINT ALGORITHM FOR LO BASED ON A NEW KERNEL FUNCTION
    Li, Xin
    Zhang, Mingwang
    Ji, Ping
    ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2016, (36): : 319 - 334
  • [30] A primal-dual interior-point algorithm for convex quadratic semidefinite optimization based on a new kernel function
    Pang, Jinjuan
    Zhang, Mingwang
    Chen, Yuejiao
    Huang, Zhengwei
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2015, 53 (06): : 22 - 37
12345