Primal-dual infeasible-interior-point algorithm for linear programming

被引：0

作者：

Kojima, Masakazu ^{[1
]}

Megiddo, Nimrod ^{[1
]}

Mizuno, Shinji ^{[1
]}

机构：

[1] Tokyo Inst of Technology, Tokyo, Japan

来源：

Mathematical Programming, Series A | 1993年 / 61卷 / 03期

关键词：

Global convergence - Infeasible interior point algorithms - Primal dual algorithms - Step length rule;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：263 / 280

共 50 条

[31] Primal-dual Feasible Interior Point Algorithm for Convex Quadratic Programming
Yong, Longquan
PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON MODELLING AND SIMULATION (ICMS2009), VOL 3, 2009, : 109 - 113
[32] A primal-dual interior point algorithm for solving bilevel programming problem
Weng, WT
Wen, UP
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2000, 17 (02) : 213 - 231
[33] A Modified Infeasible-Interior-Point Algorithm for Linear Optimization Problems
H. Mansouri
M. Zangiabadi
M. Arzani
Journal of Optimization Theory and Applications, 2015, 166 : 605 - 618
[34] A Modified Infeasible-Interior-Point Algorithm for Linear Optimization Problems
Mansouri, H.
Zangiabadi, M.
Arzani, M.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2015, 166 (02) : 605 - 618
[35] An arc-search O(nL) infeasible-interior-point algorithm for linear programming
Yang, Yaguang
Yamashita, Makoto
OPTIMIZATION LETTERS, 2018, 12 (04) : 781 - 798
[36] AN INFEASIBLE-INTERIOR-POINT ALGORITHM FOR LINEAR COMPLEMENTARITY-PROBLEMS
WRIGHT, SJ
MATHEMATICAL PROGRAMMING, 1994, 67 (01) : 29 - 51
[37] IMPROVED INFEASIBLE-INTERIOR-POINT ALGORITHM FOR LINEAR COMPLEMENTARITY PROBLEMS
Zangiabadi, M.
Mansouri, H.
BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2012, 38 (03) : 787 - 803
[38] A numerical study of an infeasible primal-dual path-following algorithm for linear programming
Achache, M.
Roumili, H.
Keraghel, A.
APPLIED MATHEMATICS AND COMPUTATION, 2007, 186 (02) : 1472 - 1479
[39] SUPERLINEAR CONVERGENCE OF INFEASIBLE-INTERIOR-POINT METHODS FOR LINEAR-PROGRAMMING
ZHANG, Y
ZHANG, DT
MATHEMATICAL PROGRAMMING, 1994, 66 (03) : 361 - 377
[40] Dual versus primal-dual interior-point methods for linear and conic programming
M. J. Todd
Mathematical Programming, 2008, 111 : 301 - 313

← 1 2 3 4 5 →