An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations
Clóvis C. Gonzaga · Springer eBooks · 1989
Cited by 202 works. doi:10.1007/978-1-4613-9617-8_1
Authors
References
- A new polynomial-time algorithm for linear programming
- Nonlinear Programming: Sequential Unconstrained Minimization Techniques
- Nonlinear Programming--Sequential Unconstrained Minimization Techniques
- Numerical Methods for Non-Linear Optimization
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Pathways to Solutions, Fixed Points, and Equilibria.
- An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations
- On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method.