85

An O(nL)iteration homogenous and selfdual linear programming algorithm
– Y Ye, M J Todd, S Mizonu
 1994

267

On implementation of a (primaldual) interior point method
– S Mehrotra
 1992

75

Computational experience with a primaldual interior point method for linear programming
– I J Lustig, R E Marsten, D F Shanno
 1992

89

On implementing mehrotra's predictorcorrector interior point method for linear programming
– I J Lustig, R E Marsten, D F Shanno
 1992

652

A NEW POLYNOMIALTIME ALGORITHM FOR LINEAR PROGRAMMING
– N. Karmarkar
 1984

28

Solving symmetric indefinite systems in an interior point method for linear programming
– R Fourer, S Mehrotra
 1991

181

Monotonicity of primaldual interiorpoint algorithms for semidefinite programming problems
– Masakazu Kojima, Levent Tuncel
 1998

122

Interior point methods for linear programming: Computational state of the art
– I J Lustig, R E Marsten, D F Shanno
 1994

28

Polyhedral convex cones
– A J Goldman, A W Tucker

124

Electronic mail distribution of linear programming test problems
– D Gay
 1985

63

A primaldual infeasibleinteriorpoint algorithm for linear programming
– M Kojima, N Megiddo, S Mizuno
 1993

774

Semidefinite Programming
– Lieven Vandenberghe, Stephen Boyd
 1996

42

Symmetric indefinite systems for interior point methods
– R J Vanderbei, T J Carpenter
 1993

33

Homogeneous InteriorPoint Algorithms for Semidefinite Programming
– Florian A. Potra, Rongqin Sheng
 1995

28

Further development of a primaldual interior point method
– I C Choi, C L Monma, D F Shanno
 1990

145

Pathways to the optimal set in linear programming
– N Megiddo
 1987

11

Computing projections for the Karmarkar algorithm
– K Turner
 1991

482

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
– Farid Alizadeh
 1993

57

An Implementation Of Karmarkar's Algorithm For Linear Programming
– Ilan Adler, Narendra Karmarkar, Mauricio G. C. Resende, Geraldo Veiga
 1986
