scientific article

zbMath0968.90519MaRDI QIDQ2743961

Jun Ji, Yinyu Ye, Kurt M. Anstreicher, Florian A. Potra

Publication date: 18 September 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items

Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure., A lower bound on the number of iterations of long-step primal-dual linear programming algorithms, Smoothed analysis of condition numbers and complexity implications for linear programming, On the probabilistic complexity of finding an approximate solution for linear programming, Average number of iterations of some polynomial interior-point -- algorithms for linear programming, Interior-point methods, A quantum interior-point predictor–corrector algorithm for linear programming