Menu: Home :: go to Journal :: switch to Russian :: switch to English
You are here: all Journals and Issues→ Journal→ Issue→ Article

PROGRAMMED ITERATION METHOD IN ABSTRACT GAME OF RETENTION AND OPERATOR CONVEXITY

Annotation

The article investigates the relations of abstract versions of the programmed iterations method and structures associated with the construction of the convex hull through prehull operator. We consider the game problem of retention of trajectories of an abstract system in a given set.

Keywords

programming iterations; operator convexity

Full-text in one file

Download

UDC

517.977

Pages

1425-1428

References

1. Chentsov A.G. Metod programmnykh iteratsiy dlya resheniya abstraktnoy zadachi uderzhaniya // Avtomatika i telemekhanika. 2004. № 2. S. 157–169. 2. Chentsov A.G. O zadache upravleniya s ogranichenym chislom pereklyucheniy: deponirovannaya rukopis': 4942-V 87. Sverdlovsk: Ural'skiy politekhnicheskiy institut im. S.M.Kirova, 1987. 3. Chentsov A.G. K voprosu o sootnoshenii razlichnykh versiy metoda programmnykh iteratsiy: pozitsionnyy variant // Kibernetika i sistemnyy analiz. 2002. № 3. S. 130–149. 4. Soltan V.P. Vvedenie v aksiomaticheskuyu teoriyu vypuklosti / pod red. V.I. Arnautov. Kishinev: Shtiintsa, 1984. s. 224.

Received

2015-04-09

Section of issue

Scientific articles

Для корректной работы сайта используйте один из современных браузеров. Например, Firefox 55, Chrome 60 или более новые.