1. [1] P.J.C. Dickinson and L. Gijben, “On the computational complexity of membership problems for the completely positive cone and its dual,” Comput. Optim. Appl., vol. 57, no. 2, pp. 403-415, 2014.
2. [2] R.B. Kearfott, M.T. Nakao, A. Neumaier, S.M. Rump, S.P. Shary, and P. van Hentenryck, “Standardized notation in interval analysis,” Comput. Technol., vol. 15, no. 1, pp. 7-13, 2010.
3. [3] S.M. Rump, “Verification methods: Rigorous results using floating-point arithmetic,” Acta Numer., vol. 19, pp. 287-449, 2010.
4. [4] S. Oishi, K. Ichihara, M. Kashiwagi, T. Kimura, X. Liu, H. Masai, Y. Morikura, T. Ogita, K. Ozaki, S.M. Rump, K. Sekine, A. Takayasu, and N. Yamanaka, Principle of Verified Numerical Computations, Tokyo, Japan: Corona publisher, 2018.[in Japanese].
5. [5] R. Krawczyk, “Fehlerabschätzung bei linearer Optimierung,” Interval Mathematics (K. Nickel, ed.), pp. 215-222, Springer Berlin Heidelberg, 1975.