|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
N. I. Pogodaev, M. V. Staritsyn, “Exact formulae for the increment of the objective functional and necessary optimality conditions, alternative to Pontryagin's maximum principle”, Mat. Sb., 215:6 (2024), 77–110    ; Sb. Math., 215:6 (2024), 790–822   |
|
2023 |
| 2. |
Maksim V. Staritsyn, Nikolay I. Pogodaev, Elena V. Goncharova, “Pontryagin's maximum principle and indirect descent method for optimal impulsive control of nonlocal transport equation”, Bulletin of Irkutsk State University. Series Mathematics, 46 (2023), 66–84 |
|
2022 |
| 3. |
N. I. Pogodaev, M. V. Staritsyn, “Nonlocal balance equations with parameters in the space of signed measures”, Mat. Sb., 213:1 (2022), 69–94 ; Sb. Math., 213:1 (2022), 63–87 |
5
|
|
2019 |
| 4. |
M. V. Staritsyn, N. I. Pogodaev, “On a class of problems of optimal impulse control for a continuity equation”, Trudy Inst. Mat. i Mekh. UrO RAN, 25:1 (2019), 229–244  |
2
|
|
2018 |
| 5. |
M. V. Staritsyn, N. S. Maltugueva, N. I. Pogodaev, S. P. Sorokin, “Impulsive control of systems with network structure describing spread of political influence”, Bulletin of Irkutsk State University. Series Mathematics, 25 (2018), 126–143 |
1
|
|
2017 |
| 6. |
O. N. Samsonyuk, M. V. Staritsyn, “Impulsive control systems with trajectories of bounded $p$-variation”, Bulletin of Irkutsk State University. Series Mathematics, 19 (2017), 164–177 |
2
|
|
2015 |
| 7. |
E. V. Goncharova, M. V. Staritsyn, “Optimal impulsive control problem with state and mixed constraints: the case of vector-valued measure”, Avtomat. i Telemekh., 2015, no. 3, 13–21 ; Autom. Remote Control, 76:3 (2015), 377–384 |
7
|
|
2014 |
| 8. |
Maxim Staritsyn, “On optimal control of a stationary populational model of a logistic type”, Program Systems: Theory and Applications, 5:5 (2014), 37–44 |
|
2010 |
| 9. |
E. Goncharova, M. Staritsyn, “Gradient Algorithms for Optimal Impulsive Control”, UBS, 31 (2010), 35–48 |
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: