[1] |
Oettli, W., An iterative method, having linear rate of convergence, for solving a pair of dual linear programs, (Report No. 7204-OR (1972), Institut für Ökonometrie und Operations Research, Universität Bonn) · Zbl 0259.90019 |
[2] |
Krabs, W., Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems, Computing, (Arch. Elektron. Rechnen), 4, 216-224 (1969) · Zbl 0187.10303 |
[3] |
Duffin, R. J., Infinite programs, Ann. of Math. Studies, 38, 157-170 (1956) · Zbl 0072.37603 |
[4] |
Eisenberg, E., Duality in homogeneous programming, (Proc. Amer. Math. Soc., 12 (1961)), 783-787 · Zbl 0102.15503 |
[5] |
Booth, A. D., An application of the method of steepest descent to the solution of systems of non-linear simultaneous equations, Quart. J. Mech. Appl. Math., 2, 460-468 (1949) · Zbl 0035.07502 |
[6] |
Polyak, B. T., USSR Comput. Math. and Math. Phys., 9, 14-29 (1969), (English translation) · Zbl 0229.65056 |
[7] |
Berge, C.; Ghouila-Houri, A., Programmes, jeux et réseaux de transport (1962), Dunod: Dunod Paris · Zbl 0111.17302 |