On the Complexity of a Linear Programming Predictor-Corrector Algorithm Using the Two Norm Neighborhood

被引：0
|
作者：
Teixeira, Ana [1 ,2 ]
Almeida, R. [1 ,2 ]
机构：
[1] Univ Minho Pole CMAT UTAD, Ctr Math, Braga, Portugal
[2] Univ Tras Os Montes & Alto Douro, Dept Math, P-5000801 Vila Real, Portugal
来源：
OPTIMIZATION, LEARNING ALGORITHMS AND APPLICATIONS, OL2A 2022 | 2022年 / 1754卷
关键词：
Feasible predictor-corrector algorithm; Transportation and assignment problems; Polynomial complexity; INTERIOR-POINT ALGORITHMS; CONVERGENCE ANALYSIS; POLYNOMIALITY;
D O I：
10.1007/978-3-031-23236-7_37
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this work the complexity of a feasible variant of a Linear Programming Predictor-Corrector algorithm specialized for transportation and assignment problems is explored. A O(n| log(epsilon)|) iteration complexity was achieved by proving that the step size computed by the studied algorithm is bounded at each iteration by theta(4-3 theta)(1-theta)(2)/n, where theta is an element of [0, 1[. Therefore, allowing to conclude that the analyzed Predictor-Corrector algorithm that uses the 2-norm neighborhood has polynomial iteration complexity and is Q-linearly convergent.
引用
收藏
页码：533 / 545
页数：13
相关论文
共 50 条
  • [31] Wide-neighborhood predictor-corrector algorithm for a class of nonlinear complementarity problem
    Dept. of Mathematics, Science Coll., Three Gorges Univ., Yichang 443002, China
    Xi Tong Cheng Yu Dian Zi Ji Shu/Syst Eng Electron, 2007, 12 (2158-2161+2179):
  • [32] The predictor-corrector algorithm for hourglass control
    Sun, Zhiyuan
    Liu, Jun
    Wang, Pei
    COMPUTERS & FLUIDS, 2020, 209 (209)
  • [33] COMPLEXITY ANALYSIS OF A PREDICTOR-CORRECTOR INTERIOR-POINT ALGORITHM FOR P*(κ)-WEIGHTED LINEAR COMPLEMENTARITY PROBLEMS
    Chi, Xiaoni
    Yang, Yuping
    Chen, Jein-shan
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2024,
  • [34] On the convergence of a predictor-corrector variant algorithm
    R. Almeida
    A. Teixeira
    TOP, 2015, 23 : 401 - 418
  • [35] COMPLEXITY ANALYSIS OF A PREDICTOR-CORRECTOR INTERIOR-POINT ALGORITHM FOR P*(κ)-WEIGHTED LINEAR COMPLEMENTARITY PROBLEMS
    Chi, Xiaoni
    Yang, Yuping
    Chen, Jein-Shan
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2025, 21 (01) : 731 - 750
  • [36] On the convergence of a predictor-corrector variant algorithm
    Almeida, R.
    Teixeira, A.
    TOP, 2015, 23 (02) : 401 - 418
  • [37] On Polynomiality of a Predictor-Corrector Variant Algorithm
    Almeida, R.
    Bastos, F.
    Teixeira, A.
    NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS I-III, 2010, 1281 : 959 - +
  • [38] PREDICTOR-CORRECTOR METHOD FOR DYNAMIC-PROGRAMMING
    LEW, A
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1974, AC19 (01) : 54 - 56
  • [39] Validated infeasible interior-point predictor-corrector methods for linear programming
    Idriss, II
    Walter, WV
    NUMERICAL ALGORITHMS, 2004, 37 (1-4) : 177 - 185
  • [40] A predictor-corrector algorithm for linear optimization based on a modified Newton direction
    Xu Y.
    Zhang L.
    Jin Z.
    Journal of Applied Mathematics and Computing, 2012, 40 (1-2) : 73 - 86
12345