1. E. A. Nurminskii, “Method of Successive Projections for Solving the Least Distance Problem for Simplexes,” Elektron. Zh. “Issledovano v Rossii” 160, 1732–1739 (2004); http://zhurnal.ape.relarn.ru/articles/2004/160.pdf .
2. E. A. Nurminskii, “Convergence of the Suitable Affine Subspace Method for Finding the Least Distance to a Simplex,” Zh. Vychisl. Mat. Mat. Fiz. 45, 1996–2004 (2005) [Comput. Math. Math. Phys. 45, 1915–1922 (2005)].
3. E. A. Nurminskii, “Acceleration of Iterative Methods of Protection onto a Polyhedron,” Dal’nevost. Mat. Sb., 1, 51–62 (1995).
4. C. Lemarechal and J.-B. Hiriart-Urruty, Convex Analysis and Minimization Algorithms II (Springer-Verlag, Berlin, 1993).
5. V. F. Dem’yanov and A. M. Rubinov, Fundamentals of Nonsmooth Analysis and Quasi-Differential Calculus (Nauka, Moscow, 1990) [in Russian].