A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms

被引：16

作者：

Bai, Yan Qin ^{[1
]}

Guo, Jin Li ^{[2
]}

Roos, Cornelis ^{[3
]}

机构：

[1] Shanghai Univ, Dept Math, Shanghai 200436, Peoples R China

[2] Shanghai Univ Sci & Technol, Sch Business, Shanghai 200093, Peoples R China

[3] Delft Univ Technol, Fac Elect Engn Math & Comp Sci, NL-2600 GA Delft, Netherlands

来源：

ACTA MATHEMATICA SINICA-ENGLISH SERIES | 2009年 / 25卷 / 12期

基金：

中国国家自然科学基金;

关键词：

linear optimization; interior-point method; primal-dual method; large-update method; polynomial complexity;

D O I：

10.1007/s10114-009-6457-8

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Kernel functions play an important role in defining new search directions for primal-dual interior-point algorithm for solving linear optimization problems. In this paper we present a new kernel function which yields an algorithm with the best known complexity bound for both large- and small-update methods.

引用

页码：2169 / 2178

页数：10

共 50 条

[1] A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
Yan Qin Bai
Jin Li Guo
Cornelis Roos
Acta Mathematica Sinica, English Series, 2009, 25 : 2169 - 2178
[2] A New Kernel Function Yielding the Best Known Iteration Bounds for Primal-Dual Interior-Point Algorithms
Cornelis ROOS
ActaMathematicaSinica(EnglishSeries), 2009, 25 (12) : 2169 - 2178
[3] 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
Kheirfam B.
Afrika Matematika, 2017, 28 (3-4) : 389 - 406
[4] A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
Liu, Liying
Li, Shaoyong
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2011, 235 (09) : 2944 - 2955
[5] A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
Cho, G. M.
Cho, Y. Y.
Lee, Y. H.
ANZIAM JOURNAL, 2010, 51 (04): : 476 - 491
[6] A NEW PARAMETRIC KERNEL FUNCTION YIELDING THE BEST KNOWN ITERATION BOUNDS OF INTERIOR-POINT METHODS FOR THE CARTESIAN P*(k)-SCLCP
Cai, X. Z.
Li, L.
El Ghami, M.
Steihaug, T.
Wang, G. Q.
PACIFIC JOURNAL OF OPTIMIZATION, 2017, 13 (04): : 547 - 570
[7] 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
[8] 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
[9] A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
Guoqiang Wang
Detong Zhu
Numerical Algorithms, 2011, 57 : 537 - 558
[10] A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
Wang, Guoqiang
Zhu, Detong
NUMERICAL ALGORITHMS, 2011, 57 (04) : 537 - 558

← 1 2 3 4 5 →