[1] M. S. Bazaraa, C. M. Shetty: Nonlinear Programming - Theory and Algorithms. Wiley, New York 1979. MR 0533477 | Zbl 0476.90035

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

[3] S. P. Han: Variable metric methods for minimizing a class of nondifferentiable functions. Math. Programming 20 (1981), 1, 1-13. MR 0594019 | Zbl 0441.90095

[4] L. Lukšan: Variable metric methods for linearly constrained nonlinear minimax approximation. Computing 30 (1983), 3, 315-334. MR 0706672

[5] L. Lukšan: Dual method for solving a special problem of quadratic programming as a sub-problem at nonlinear minimax approximation. Computing (submitted for publication).

[6] K. Madsen, H. Schjaer-Jacobsen: Linearly constrained minimax optimization. Math. Programming 14 (1978), 2, 208-223. MR 0472055 | Zbl 0375.65034

[7] M. J. D. Powell: A fast algorithm for nonlinearly constrained optimization calculations. In: Numerical Analysis, Dundee 1977 (Lecture Notes in Mathematics 630, G. A. Watson, ed.). Springer-Verlag, Berlin-Heidelberg-New York 1978. MR 0483447

[8] P. Wolfe: Finding the nearest point in a polytope. Math. Programming 11 (1976), 2, 128- 149. MR 0452683 | Zbl 0352.90046

[9] L. Lukšan: An implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximation. Kybernetika 21 (1985), 1 (to appear). MR 0788667