UTEC and Ferut: the University of Toronto's computation centre

Although not well known, the University of Toronto had a very early computer-development program and in 1952 was one of the first few institutions with an operable computer in North America. This article describes the university's initial attempt to build the UTEC computer and how it acquired the pioneering Ferut machine     

Base-type languages: Program design by upper semantic approximation

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 140–155, July–August 1994.     

Multicriterion differential games

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 24–33, January–February, 1994.     

Nonlocal quasi-Newton method for solving convex variational inequalities

Conclusion In the optimization problem [f ₀(x)│h_i(x)<-0,i=1,…,l] relaxation of the functionf ₀(x)+Nh⁺(x) does not produce, as we know [6, 7], α_k=1 in Newton's method with the auxiliary problem (5), (6), whereF(x)=f _0′(x). For this reason, Newton type methods based on relaxation off ₀(x)+Nh⁺(x) are not superlinearly convergent (so-called Maratos effect). The results of this article indicate that if (F(x)=f _0′(x), then replacement of the initial optimization problem with a larger equivalent problem (7) eliminates the Maratos effect in the proposed quasi-Newton method. This result is mainly of theoretical interest, because Newton type optimization methods in the space of the variablesx ∈R ⁿ are less complex. However to the best of our knowledge, the difficulties with nonlocal convergence arising in these methods (choice of parameters, etc.) have not been fully resolved [10, 11]. The discussion of these difficulties and comparison with the proposed method fall outside the scope of the present article, which focuses on solution of variational inequalities (1), (2) for the general caseF′(x)≠F′ ^T(x). Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 78–91, November–December, 1994.