Primal-dual Interior Point Algorithm for Linear Programming

被引:0
|
作者
Yong, Longquan [1 ]
机构
[1] Shaanxi Univ Technol, Dept Math, Hanzhong 723001, Peoples R China
关键词
Linear programming; Primal-dual interior point algorithm; Polynomial complexity;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The linear programming and its importance is well known, over the past decade, an increasing number of studies have focused on this problem. In this paper we present a primal-dual interior point algorithm for linear programming which is based on the Newton direction. We showed that if a strictly feasible starting point is available, then the algorithms have the polynomial complexity. Primary numerical results are reported which demonstrate very good computational performance on linear programming.
引用
收藏
页码:432 / 436
页数:5
相关论文
共 50 条
  • [21] A MUTUAL PRIMAL-DUAL LINEAR PROGRAMMING ALGORITHM
    HARRIS, MY
    NAVAL RESEARCH LOGISTICS QUARTERLY, 1970, 17 (02): : 199 - &
  • [22] An adaptive-step primal-dual interior point algorithm for linear optimization
    Kim, Min Kyung
    Lee, Yong-Hoon
    Cho, Gyeong-Mi
    NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2009, 71 (12) : E2305 - E2315
  • [23] A primal-dual interior point method for nonlinear semidefinite programming
    Yamashita, Hiroshi
    Yabe, Hiroshi
    Harada, Kouhei
    MATHEMATICAL PROGRAMMING, 2012, 135 (1-2) : 89 - 121
  • [24] A NEW FRAMEWORK OF PRIMAL-DUAL INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR PROGRAMMING
    林正华
    宋岱才
    刘庆怀
    "Numerical Mathematics A Journal of Chinese Universities(English Series) N", 1998, (02) : 183 - 194
  • [25] A Primal-Dual Slack Approach to Warmstarting Interior-Point Methods for Linear Programming
    Engau, Alexander
    Anjos, Miguel F.
    Vannelli, Anthony
    OPERATIONS RESEARCH AND CYBER-INFRASTRUCTURE, 2009, : 195 - +
  • [26] COMPLEXITY OF PRIMAL-DUAL INTERIOR-POINT ALGORITHM FOR LINEAR PROGRAMMING BASED ON A NEW CLASS OF KERNEL FUNCTIONS
    Guerdouh, Safa
    Chikouche, Wided
    Touil, Imene
    Yassine, Adnan
    KYBERNETIKA, 2023, 59 (06) : 827 - 860
  • [27] A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming
    Potra, FA
    Sheng, RQ
    SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (04) : 1007 - 1028
  • [28] A primal-dual interior point algorithm with an exact and differentiable merit function for nonlinear programming
    Akrotirianakis, I
    Rustem, B
    OPTIMIZATION METHODS & SOFTWARE, 2000, 14 (1-2): : 1 - 36
  • [29] A primal-dual interior-point algorithm with arc-search for semidefinite programming
    Zhang, Mingwang
    Yuan, Beibei
    Zhou, Yiyuan
    Luo, Xiaoyu
    Huang, Zhengwei
    OPTIMIZATION LETTERS, 2019, 13 (05) : 1157 - 1175
  • [30] IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming
    Rui-Jin Zhang
    Xin-Wei Liu
    Yu-Hong Dai
    Journal of Global Optimization, 2023, 87 : 1027 - 1053