Abstract:
Notwithstanding the success of the simplex method for linear programming (LP), there was, even from the earliest days of operations research, a desire to create an algorithm for solving linear programming problems that proceeded on a path through the polytope
Citations
|
457
|
A new polynomial-time algorithm for linear programming
– Karmarkar
- 1984
|
|
422
|
Semidefinite Programming
– Vandenberghe, Boyd
- 1996
|
|
259
|
A polynomial algorithm in linear programming
– Khachiyan
- 1979
|
|
230
|
Nonlinear programming: Sequential Unconstrained Minimization Techniques
– Fiacco, McCormick
- 1990
|
|
185
|
Interior point polynomial methods in convex programming: Theory and algorithms
– Nesterov, Nemirovsky
- 1993
|
|
126
|
A Unified Approach to Interior Point Algorithms for Linear Complimentarity Problems
– Kojima, Meggido, et al.
- 1991
|
|
108
|
Path following methods for linear programming
– Gonzaga
|
|
103
|
How good is the simplex algorithm
– Klee, Minty
- 1972
|
|
89
|
Iterative solutions of problems of linear and quadratic programming
– Dikin
- 1967
|
|
37
|
The Simplex Method: A Probabilistic Analysis
– Borgwardt
- 1987
|
|
33
|
An “analytic” center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming
– Sonnevend
|
|
29
|
On search directions in interior-point methods for semidefinite programming
– Todd
- 1997
|
|
27
|
Resolution of Mathematical Programming with Nonlinear Constraints by the Method of Centers
– Huard
- 1967
|
|
20
|
Linear programming
– Goldfarb, Todd
- 1989
|
|
19
|
The use of the optimal partition in a linear programming solution for postoptimal analysis
– Greenberg
- 1994
|
|
14
|
The interior-point revolution in constrained optimization
– Wright
- 1998
|
|
4
|
Interior Point Algorithms
– Ye
- 1997
|
|
3
|
Advances in linear optimization
– Roos, Terlaky
- 1997
|
|
2
|
Interior Point Approach to Linear Optimization: Theory and Algorithms
– Vial
- 1997
|
|
1
|
Principles of linear programming -- the double gradient form of the logarithmic potential method." Memorandum
– Frish
- 1954
|
|
1
|
Hertog
– den
- 1994
|
|
1
|
A strongly polynomial rounding scheme in interior point methods for P () linear complementarity problems
– Ill'es, Peng, et al.
- 1998
|
|
1
|
Interior Point Techniques in ptimization. Complexity, Sensitivity and Algorithms
– Jansen
- 1997
|
|
