652

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

22

Selfconcordant functions and polynomialtime methods in convex programming
– Y E Nesterov, A S Nemirovsky
 1989

142

A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems: A Summary
– Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise
 1990

23

Fractional programming
– S Schaible
 1976

30

InteriorPoint Methods for Convex Programming
– F Jarre
 1990

3

Gewohnlich Differentialgleichungen; Teubner
– H W Knobloch, F Kappel
 1974

4

On the method of analytic centers for solving smooth convex problems
– F Jarre
 1989

4

An interior{point method for minimizing the largest eigenvalue of a linear combination of matrices
– F Jarre
 1991

14

A general approach to polynomialtime algorithms design for convex programming
– Nesterov, A Nemirovsky

29

An `analytical centre' for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming
– G Sonnevend
 1986

146

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

9

A PathFollowing Algorithm for a Class of Convex Programing Problems, Zeitschrift fur
– J Zhu
 1992

5

An InteriorPoint Method For Convex Fractional Programming
– Roland W. Freund, Florian Jarre
 1993

1

F.: On the complexity of fractional programs with convex constraints
– R W Freund, Jarre

6

An InteriorPoint Method for MultiFractional Programs with Convex Constraints
– Roland W. Freund, Florian Jarre
 1993

1

An interiorpoint method for convex multifractional programming
– R W Freund, F Jarre

1

On the complexity of convex fractional programs
– R W Freund, F Jarre

1

Bibliography in fractional programming," Zeitschrift fur Operations Research 26
– S Schaible
 1982

8

Ghaoui, "Method of Centers for Minimizing Generalized Eigenvalues
– S P Boyd, L El
 1992
