[1] J. T. Betts: An accelerated multiplier method for nonlinear programming. J. Optim. Theory Appl. 21 (1977), 2, 137-174. MR 0432224 | Zbl 0325.65027

[2] W. C. Davidon: Optimally conditioned optimization algorithms without line searches. Math. Programming 9 (1975), 1,1-30. MR 0383741 | Zbl 0328.90055

[3] P. E. Gill W. Murray: A numerically stable form of the simplex algorithm. Linear Algebra Appl. 7 (1973), 2, 99-138. MR 0321519

[4] P. E. Gill W. Murray: Newton-type methods for unconstrained and linearly constrained optimization. Math. Programming 7 (1974), 3, 311 - 350. MR 0356503

[5] D. Goldfarb: Extension of Davidon's variable metric method to maximization under inequality and equality linear constraints. SIAM J. Appl. Math. 17 (1969), 4, 739-764. MR 0290799

[6] L. Lukšan: Quasi-Newton methods without projections for unconstrained minimization. Kybernetika 18 (1892), 4, 290-306. MR 0688368

[7] K. Ritter: A variable metric method for linearly constrained minimization problems. In: Nonlinear Programming 3 (O. L. Mangasarian, R. R. Meyer, S. M. Robinson eds.). Academic Press, London 1978. MR 0507864 | Zbl 0464.65041

[8] W. Hock K. Schittkowski: Test Examples for Nonlinear Programming Codes. (Lecture Notesin Economics and Mathematical Systems 187.) Springer - Verlag, Berlin-Heidelberg-New York 1981. MR 0611512