1. Bartelt, N.W. and H.W. McLaughlin (1973) Characterizations of strong unicity in approximation theory, J. Approximation Theory 9, 255–266.
2. Blatt, H.-P., U. Kaiser and B. Ruffer-Beedgen (1983) A multiple exchange algorithm in convex programming, in “Optimization: Theory and algorithms” (J.B. Hiriart-Urruty, W. Oettli, J. Stoer (ed.)), Narcel Dekker, New York, 113–130.
3. Blatt, H.-P., Exchange algorithms, error estimations and strong unicity in convex programming and Chebyshev approximation, to appear in Proceedings of the NATO-Advanced Study Institute, St. John’s, Newfoundland (Canada), August 1983.
4. Brosowski, B. (1984) A refinement of an optimality criterion and its application to parametric programming, J. of Optimization Theory and Appl. 42, 367–382.
5. Carasso, C. and P.J. Laurent (1978) Un algorithme de minimisation en chaine en optimisation convexe, SIAM J. Control and Optimization 16, 209–235.