Certain constructions of asymptotic analysis related to the Stone-Čcech compactification

The paper considers the representations of attraction sets in topological spaces and their relations with the relaxation of accessibility problems under the conditions of sequentially relaxed constraints. The author studies the structure of approximate (in essence, asymptotic) solutions and generalized elements and establishes the possibility of their real identification for a certain version (related to the Stone-Čech compactification and the Wallman relaxation) of relaxation of the initial problem. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 26, Nonlinear Dynamics, 2005.     

Nonparametric decision-making models for large samples

Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Fizika, No. 9, pp. 79–83, September, 1995.     

Generalized elements in problem on asymptotic attainability

We consider a problem which implies the choice of a solution subject to asymptotic constraints. We represent the results as ultrafilters of the space of ordinary estimates (the space is not necessarily endowed with a topology). This representation corresponds to an abstract attainability problem in its nonsequential asymptotic version.     

On approximate constraint satisfaction

We consider an abstract problem on fulfilling asymptotic constraints. We propose a very general approach to constructing “nonsequential” attraction sets in the space of generalized elements formalizable as finitely additive measures. We study the existence and the structure of the asymptote universal in the range of “asymptotic constraints” not requiring the compactifiability of the space of ordinary solutions.     

Route problem with constraints depending on a list of tasks

An additive route problem with preceding conditions is considered in which the cost function and the move constraints both depend on a list of tasks that have not been performed by the current time. The problem is solved by applying a dynamic programming method that takes into account both these factors and is implemented in the construction of a (generally) incomplete array of Bellman function values.     

Quasistrategies in an abstract guidance control problem

We consider an abstract guidance control problem with elements of uncertainty, where the control procedures are identified with set-valued quasistrategies. The goal of the control consists in the guidance to the objective set under phase constraints.We construct the solvability set by the method of program iterations which is well known in the theory of differential games. We prove that the limit of the iterative procedure has the sense of the set of positional absorption (the stable bridge) introduced by N. N. Krasovskii. This limit coincides with the solvability set in the class of quasistrategies.     

Extremal routing problem with internal losses

We discuss an approach to studying Fano manifolds based on Homological Mirror Symmetry. We consider some classical examples from a new point of view. To the cherished memory of our unforgettable teacher V.A. Iskovskikh