Programmed iteration method and operator convexity in an abstract retention problem

DOI10.20537/VM150305MaRDI QIDQ3186938zbMATH OpenOpenAlexFDO

Authors A. G. Chentsov, Dmitriĭ A. Serkov

Publication date 12 August 2016

Published in Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/vuu489

zbMATH Keywords

operator convexityprogrammed iterationsquasistrategies

Mathematics Subject Classification ID

Dynamical systems in control (37N35) Iterative procedures involving nonlinear operators (47J25) Axiomatic and generalized convexity (52A01) Numerical solutions to equations with nonlinear operators (65J15) Dynamic games (91A25)

Recommendations

• The elements of the operator convexity in the construction of the programmed iteration method
• Implementation of the programmed iterations method in packages of spaces
• The program constructions in abstract retention problem
• Transfinite sequences in the programmed iteration method
• On a representation of the solvability set in the retention problem

Cited in

(7)

• An abstract confinement problem: A programmed iterations method of solution
• Transfinite version of the program iteration method in a game problem of approach for an abstract dynamical system
• The elements of the operator convexity in the construction of the programmed iteration method
• On a representation of the solvability set in the retention problem
• The program constructions in abstract retention problem
• Implementation of the programmed iterations method in packages of spaces
• Transfinite sequences in the programmed iteration method

This page was built for publication: Programmed iteration method and operator convexity in an abstract retention problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186938)