On the method of analytic centers for solving smooth convex programs
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
A polynomial-time algorithm, based on Newton's method, for linear programming
1988 • 587 citations
An implementation of Karmarkar's algorithm for linear programming
1989 • 424 citations
An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming
2006 • 359 citations
An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations
1989 • 204 citations
Fast algorithms for convex quadratic programming and multicommodity flows
1986 • 90 citations
A multiplicative barrier function method for linear programming
1986 • 79 citations
New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation
1988 • 74 citations
A new continuation method for complementarity problems with uniformP-functions
1989 • 69 citations
Karmarkar's linear programming algorithm and Newton's method
1991 • 54 citations
Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
1990 • 46 citations
An implementation of the method of analytic centers
2006 • 29 citations
Containing and shrinking ellipsoids in the path-following algorithm
1990 • 25 citations