A model of overpowering a multilevel defense system by attack

DOI10.1007/s10598-016-9319-0zbMath1336.93028OpenAlexW2283952992MaRDI QIDQ285117

V. Yu. Reshetov, I. A. Lesik, A. G. Perevozchikov

Publication date: 18 May 2016

Published in: Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10598-016-9319-0

zbMATH Keywords

almost-sure convergence of the randomized procedureaveraging of the right-hand sidescombined gradient projection method and Polyak methodconjugate systemdiscrete optimal controlobjective-function differentiability conditionsrandomization of the combined gradient descent methodstochastic gradient of the average problemstructure of the derivatives of the averaged functionsstructure of the objective function gradient

Mathematics Subject Classification ID

Related Items (4)

Generalized target-allocation functions and their evaluation by the branch-and-bound method ⋮ A dynamic probabilistic model of two-sided combat ⋮ A linearization method in the ``attack-defense game with nonhomogeneous opponent resources ⋮ A discrete multilevel attack-defense model with nonhomogeneous opponent resources

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A model of overpowering a multilevel defense system by attack