Consideration was given to a special problem of controlling a formation of mobile agents, that of uniform deployment of several identical agents on a segment of the straight line. For the case of agents obeying the first-order dynamic model, this problem seems to be first formulated in 1997 by I.A. Wagner and A.M. Bruckstein as “row straightening.” In the present paper, the straightening algorithm was generalized to a more interesting case where the agent dynamics obeys second-order differential equations or, stated differently, it is the agent’s acceleration (or the force applied to it) that is the control.

In order to solve robust PageRank problem a saddle-point Mirror Descent algorithm for solving convex-concave optimization problems is enhanced and studied. The algorithm is based on two proxy functions, which use specificities of value sets to be optimized on (min-max search). In robust PageRank case the ones are entropy-like function and square of Euclidean norm. The saddle-point Mirror Descent algorithm application to robust PageRank leads to concrete complexity results, which are being discussed alongside with illustrative numerical example.

The term “pattern” refers to a combination of values of some features such that objects with these feature values significantly differ from other objects. This concept is a useful tool for the analysis of behavior of objects in both statics and dynamics. If the panel data describing the functioning of objects in time is available, we can analyze pattern changing behavior of the objects and identify either well adapted to the environment objects or objects with unusual and alarming behavior.In this paper we apply static and dynamic pattern analysis to the analysis of innovative development of the Russian regions in the long run and obtain a classification of regions by the similarity of the internal structure of these indicators and groups of regions carrying out similar strategies

Даны постановки задач согласованного планирования в социальных и эколого-экономических системах. Предложен метод сетевого программирования для их решения.

A class of hybrid control systems on the base of two-level discrete-continuous model is considered. The concept of this model was proposed and developed in preceding works as a concretization of the general multi-step system with related optimality conditions. A new iterative optimization procedure for such systems is developed on the base of localization of the global optimality conditions via contraction the control set.