Interior point algorithms: Theory and analysis

被引：0

|

作者：

Wilson, J ^{[1
]}

机构：

[1] Univ Loughborough, Loughborough, Leics, England

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2000年 / 51卷 / 06期

关键词：

D O I：

10.2307/254021

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：769 / 769

页数：1

相关论文

共 50 条

[21] Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
Wei Bian
Xiaojun Chen
Yinyu Ye
Mathematical Programming, 2015, 149 : 301 - 327
[22] A COMPLEXITY ANALYSIS FOR INTERIOR-POINT ALGORITHMS BASED ON KARMARKARS POTENTIAL FUNCTION
JI, J
YE, YY
SIAM JOURNAL ON OPTIMIZATION, 1994, 4 (03) : 512 - 520
[23] Boundary behavior of interior point algorithms in linear programming
Megiddo, Nimrod, 1600, (14):
[24] Euclidean Jordan Algebras and Interior-point Algorithms
Leonid Faybusovich
Positivity, 1997, 1 : 331 - 357
[25] Steplengths in interior-point algorithms of quadratic programming
Mészáros, C
OPERATIONS RESEARCH LETTERS, 1999, 25 (01) : 39 - 45
[26] Euclidean Jordan algebras and interior-point algorithms
Faybusovich, L
POSITIVITY, 1997, 1 (04) : 331 - 357
[27] Little theorem of the big M in interior point algorithms
Kojima, Masakazu
Mizuno, Shinji
Yoshise, Akiko
Mathematical Programming, Series A, 1993, 59 (03): : 361 - 375
[28] GLOBAL CONVERGENCE IN INFEASIBLE-INTERIOR-POINT ALGORITHMS
KOJIMA, M
NOMA, T
YOSHISE, A
MATHEMATICAL PROGRAMMING, 1994, 65 (01) : 43 - 72
[29] On homogeneous interior-point algorithms for semidefinite programming
Potra, FA
Sheng, RQ
OPTIMIZATION METHODS & SOFTWARE, 1998, 9 (1-3): : 161 - 184
[30] Interior point methods in theory and practice - Introduction
Anstreicher, KM
MATHEMATICAL PROGRAMMING, 1997, 76 (01) : 1 - 2

← 1 2 3 4 5 →