On the speed of one computing model designed for finding optimal structures of a threshold element

The paper is concerned with an iterative algorithm for finding an optimal hyperplane which separates a specified finite set from the origin of coordinates. Upper and lower estimates of the number of computing iterations are given that are sufficient for finding the parameters of the optimal hyperplane with a specified accuracy. The practical sense of the notions introduced is illustrated with design of the optimal structure of a threshold element as an example.