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 条
[31]   Simplified infeasible infeasible interior-point algorithm for linear optimization based on a simple function [J].
Wang, Weiwei ;
Liu, Hongwei ;
Bi, Hongmei .
OPERATIONS RESEARCH LETTERS, 2018, 46 (05) :538-542
[32]   An interior-point method for P-*(k)-linear complementarity problem based on a trigonometric kernel function [J].
Hafshejani, S. Fathi ;
Fatemi, M. ;
Peyghami, M. Reza .
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2015, 48 (1-2) :111-128
[33]   Complexity Analysis of Primal-Dual Interior-Point Methods for Linear Optimization Based on a New Parametric Kernel Function with a Trigonometric Barrier Term [J].
Cai, X. Z. ;
Wang, G. Q. ;
El Ghami, M. ;
Yue, Y. J. .
ABSTRACT AND APPLIED ANALYSIS, 2014,
[34]   A PRIMAL-DUAL INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON A NEW PARAMETERIZED KERNEL FUNCTION [J].
Li, Mengmeng ;
Zhang, Mingwang ;
Huang, Zhengwei .
JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS, 2019, 2019
[35]   A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds [J].
Kheirfam B. .
Afrika Matematika, 2017, 28 (3-4) :389-406
[36]   INTERIOR-POINT ALGORITHM FOR SDO BASED ON NEW CLASSES OF KERNEL FUNCTIONS [J].
Lee, Yong-Hoon ;
Jin, Jin-Hee ;
Cho, Gyeong-Mi .
JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2016, 17 (01) :55-75
[37]   KERNEL FUNCTION BASED INTERIOR-POINT ALGORITHMS FOR SEMIDEFINITE OPTIMIZATION [J].
Lee, Yong-Hoon ;
Jin, Jin-Hee ;
Cho, Gyeong-Mi .
MATHEMATICAL INEQUALITIES & APPLICATIONS, 2013, 16 (04) :1279-1294
[38]   A new infeasible interior-point algorithm with full step for linear optimization based on a simple function [J].
Zhang, Lipu ;
Xu, Yinghong .
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2011, 88 (15) :3163-3185
[39]   An interior-point algorithm for P*(κ)-LCPs based on a new kernel function with a double barrier term [J].
Derbal, Louiza ;
Kebbiche, Zakia .
FILOMAT, 2024, 38 (24) :8461-8479
[40]   A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function [J].
Zhongyi Liu ;
Wenyu Sun ;
Fangbao Tian .
Applied Mathematics and Optimization, 2009, 60
12345