scientific article; zbMATH DE number 556487
From MaRDI portal
Publication:4288947
zbMATH Open0809.65056MaRDI QIDQ4288947FDOQ4288947
Authors: M. J. D. Powell 
Publication date: 28 March 1995
Title of this publication is not available (Why is that?)
Recommendations
- On the number of iterations of Karmarkar's algorithm for linear programming
- scientific article; zbMATH DE number 4170639
- Convergence in Karmarkar’s Algorithm for Linear Programming
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
- On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
linear programmingcomplexitynumerical exampleKarmarkar's algorithmnumber of iterationslog barrier version
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Linear programming (90C05)
Cited In (7)
- Interior-point algorithms for semi-infinite programming
- Title not available (Why is that?)
- Towards an asymptotic analysis of Karmarkar's algorithm
- Convergence in Karmarkar’s Algorithm for Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the number of iterations of Karmarkar's algorithm for linear programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288947)
