[1] Dikin, I.:
An iterative solution of problems of linear and quadratic programming. Doklady AN SSSR 174 (1967), 747–751.
MR 0221850
[2] Fiacco, A., Mc-Cormick, G.:
Nonlinear Programming: Sequential unconstrained minimization techniques. John Wiley and Sons, Inc., New York 1968.
MR 0243831
[3] Frisch, K. R.: The logarithmic potential method of convex programming. University Institute of Economics, Memorandum, Oslo, Norway 1955.
[4] Gill, P., Murray, W., Saunders, M., Tomlin, J., Wright, M.:
On projected Newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method. Math. Programming 36 (1986), 183–209.
DOI 10.1007/BF02592025 |
MR 0866988 |
Zbl 0624.90062
[5] Huard, P.:
Resolution of mathematical programming with nonlinear constraints by the method of centers. In Nonlinear Programming, J. Abadie, ed., North-Holland, Amsterdam 1967.
MR 0216865
[8] Khachian, L. G.:
A polynomial algorithm in linear programming. Doklady AN SSSR 244 (1979), 1093–1096.
MR 0522052
[9] Klee, V., Minty, G.:
How good is the simplex algorithm?. In: O. Shisha, ed., “Inequalities-III”. Academic Press, New York 1972.
MR 0332165 |
Zbl 0297.90047
[10] Lawler, E. L.:
Velký matematický sputnik roku 1979. PMFA 27 (1982), 39–47.
MR 0503698
[11] Lovász, L.: Je nový algoritmus lineárního programování lepší nebo horší než simplexová metóda?. PMFA 26 (1981), 193–202.
[12] Nesterov, Y. E., Nemirovsky, A. S.:
Interior Point Polynomial Algorithms in Convex Programming. SIAM Publications, Philadelphia, USA, 1994.
MR 1258086
[15] Wright, M. H.:
The interior-point revolution in constrained optimization. In: R. DeLeone, A. Murli, P. M. Pardalos, G. Toraldo: High-Performance Algorithms and Software in Nonlinear Optimization, 359–381, Kluwer Academic Publishers 1998.
MR 1789725 |
Zbl 0944.65065