The elements of the operator convexity in the construction of the programmed iteration method

DOI10.14529/MMP160307zbMATH Open1376.37139OpenAlexW2517786899MaRDI QIDQ2830896FDOQ2830896

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

Publication date: 1 November 2016

Published in: Vestnik Yuzhno-Ural'skogo Gosudarstvennogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14529/mmp160307

Recommendations

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

zbMATH Keywords

operator convexityquasistrategyprogrammed iteration

Mathematics Subject Classification ID

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

Cited In (6)

• On a dynamic game problem with an indecomposable set of disturbances
• Transfinite sequences in 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
• Programmed iteration method and operator convexity in an abstract retention problem

This page was built for publication: The elements of the operator convexity in the construction of the programmed iteration method

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