On the number of iterations of Karmarkar's algorithm for linear programming
type: Item
instance of: scholarly article
title: On the number of iterations of Karmarkar's algorithm for linear programming
zbMATH Open document ID: 0804.90092
DOI: 10.1007/BF01585165
author: M. J. D. Powell
published in: Mathematical Programming. Series A. Series B
publication date: 1994-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 558713
zbMATH Keywords: interior point methods
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: Karmarkar's algorithm
MaRDI profile type: Publication
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: Interior point algorithms for linear programming with inequality constraints
cites work: Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
cites work: Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program
cites work: A new polynomial-time algorithm for linear programming
cites work: Computational experience with a primal-dual interior point method for linear programming
cites work: Boundary Behavior of Interior Point Algorithms in Linear Programming
cites work: Q3496152
cites work: Q4288947
cites work: An extension of Karmarkar's algorithm for linear programming using dual variables
full work available at URL: https://doi.org/10.1007/bf01585165
OpenAlex ID: W2052200991
description: scientific article; zbMATH DE number 558713