|
|
Publications in Math-Net.Ru
-
Signal recovery by stochastic optimization
Avtomat. i Telemekh., 2019, no. 10, 153–172
-
Algorithms of robust stochastic optimization based on mirror descent method
Avtomat. i Telemekh., 2019, no. 9, 64–90
-
On sequential hypotheses testing via convex optimization
Avtomat. i Telemekh., 2015, no. 5, 100–120
-
$L_1$-optimal nonparametric frontier estimation via linear programming
Avtomat. i Telemekh., 2005, no. 12, 143–161
-
Recursive Aggregation of
Estimators by Mirror Descent Algorithm with Averaging
Probl. Peredachi Inf., 41:4 (2005), 78–96
-
Nonparametric frontier estimation by linear programming
Avtomat. i Telemekh., 2004, no. 1, 66–73
-
Attainable information bounds in the problem of the adaptive control of nonlinear stochastic systems under nonparametric uncertainty
Avtomat. i Telemekh., 1999, no. 3, 180–195
-
On small perturbations of stable Markov operators: unbounded case
Teor. Veroyatnost. i Primenen., 43:4 (1998), 752–764
-
Lower Information Bounds for Adaptive Tracking of a Linear Discrete Plant
Probl. Peredachi Inf., 31:1 (1995), 56–67
-
A recursive algorithm for estimating autoregression parameters
Avtomat. i Telemekh., 1992, no. 7, 118–127
-
Optimal and robust estimation of slowly drifting parameters of a linear regression process
Avtomat. i Telemekh., 1991, no. 6, 66–76
-
Information inequalities in a problem of adaptive control of a
linear object
Dokl. Akad. Nauk SSSR, 317:2 (1991), 323–325
-
Remark on “Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging” published in Probl. Peredachi Inf., 2005, no. 4
Probl. Peredachi Inf., 42:3 (2006), 109
© , 2025