论文信息 - Projective transformations for interior point methods, Part I: Basic Theory and Linear Programming - 字舞流文

Projective transformations for interior point methods, Part I: Basic Theory and Linear Programming

[1] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..

[2] Earl R. Barnes,et al. A variation on Karmarkar’s algorithm for solving linear programming problems , 1986, Math. Program..

[3] G. Sonnevend. An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .

[4] Y. Censor,et al. Optimization of “log x entropy over linear equality constraints , 1987 .

[5] R. Freund. An analog of Karmarkar's algorithm for inequality constrained linear programs, with a 'new' class of projective transformations for centering a polytope , 1988 .

[6] P. M. Vaidya. A locally well-behaved potential function and a simple Newton-type method for finding the center of a polytype , 1988 .

[7] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..

[8] C. C. Gonzaga,et al. An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations , 1989 .

[9] Robert J. Vanderbei,et al. A modification of karmarkar's linear programming algorithm , 1986, Algorithmica.