Publisher
Springer International Publishing
Reference24 articles.
1. Barnes, E.R.: A variation on Karmarkar’s algorithm for solving linear programming problem. Math. Program. 36, 174–182 (1986)
2. Chen, C., Mangasarian, O.L.: Smoothing methods for convex inequalities and linear complementarity problems. Math. Program. 71, 51–69 (1995)
3. Eggermont, P.: Multiplicative iterative algorithm for convex programming. Linear Algebra Appl. 130, 25–32 (1990)
4. Gill, P., Murray, W., Saunders, J., Tomlin, J., Wright, M.: On projected Newton Barrier methods for linear programming and an equivalence to Karmarkar’s projective method. Math. Program. 36, 183–209 (1986)
5. Gonzaga, C.: An algorithm for solving linear programming problems in O(n
3
L) operations. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 1–28. Springer, New York (1989)