default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander V. Nazin
Person information
- affiliation: Russian Academy of Sciences, Trapeznikov Institute of Control Sciences, Moscow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j13]Alexander S. Poznyak, Alexander V. Nazin, Hussain Alazki
:
Integral Sliding Mode Convex Optimization in Uncertain Lagrangian Systems Driven by PMDC Motors: Averaged Subgradient Approach. IEEE Trans. Autom. Control. 66(9): 4267-4273 (2021)- 2019
- [j12]Alexander V. Nazin, Arkadi S. Nemirovsky, Alexandre B. Tsybakov, Anatoli B. Juditsky:
Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method. Autom. Remote. Control. 80(9): 1607-1627 (2019) - 2018
- [j11]Alexander V. Nazin:
Algorithms of Inertial Mirror Descent in Convex Problems of Stochastic Optimization. Autom. Remote. Control. 79(1): 78-88 (2018) - 2016
- [j10]Alexander V. Nazin, Andrey A. Tremba:
Saddle point mirror descent algorithm for the robust PageRank problem. Autom. Remote. Control. 77(8): 1403-1418 (2016) - 2014
- [j9]Alexander V. Nazin, Svetlana V. Anulova, Andrey A. Tremba:
A mirror descent algorithm for minimization of mean Poisson flow driven losses. Autom. Remote. Control. 75(6): 1010-1016 (2014) - [j8]Alexander V. Nazin, Stéphane Girard:
L 1-optimal linear programming estimator for periodic frontier functions with Hölder continuous derivative. Autom. Remote. Control. 75(12): 2152-2169 (2014) - 2006
- [j7]Anatoli B. Juditsky, Alexander V. Nazin, Alexandre B. Tsybakov, Nicolas Vayatis:
Remark on "Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging" published in Probl. Peredachi Inf., 2005, no. 4. Probl. Inf. Transm. 42(3): 262 (2006) - 2005
- [j6]Jacob Roll, Alexander V. Nazin, Lennart Ljung:
Nonlinear system identification via direct weight optimization. Autom. 41(3): 475-490 (2005) - [j5]Anatoli B. Juditsky, Alexander V. Nazin, Alexandre B. Tsybakov, Nicolas Vayatis:
Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging. Probl. Inf. Transm. 41(4): 368-384 (2005) - 2004
- [j4]Alex Poznyak, Alexander V. Nazin, Daishi Murano:
Observer matrix gain optimization for stochastic continuous time nonlinear systems. Syst. Control. Lett. 52(5): 377-385 (2004) - 2002
- [j3]Alexander V. Nazin, Lennart Ljung:
Asymptotically optimal smoothing of averaged LMS estimates for regression parameter tracking. Autom. 38(8): 1287-1293 (2002) - 1998
- [j2]Alexander V. Nazin, Vladimir Katkovnik:
Minimax lower bound for time-varying frequency estimation of harmonic signal. IEEE Trans. Signal Process. 46(12): 3235-3245 (1998) - 1992
- [j1]Alexander V. Nazin, Boris T. Polyak, Alexandre B. Tsybakov:
Optimal and robust kernel algorithms for passive stochastic approximation. IEEE Trans. Inf. Theory 38(5): 1577-1583 (1992)
Conference and Workshop Papers
- 2019
- [c18]Isaac Chairez, Alexander S. Poznyak, Alexander V. Nazin, Tatyana Poznyak:
Projectional Learning Laws for Differential Neural Networks Based on Double-Averaged Sub-Gradient Descent Technique. ISNN (1) 2019: 28-38 - 2017
- [c17]Alexander V. Nazin:
Algorithms of Inertial Mirror Descent in Stochastic Convex Optimization Problems. ACMPT 2017: 376-387 - 2015
- [c16]Alexander V. Nazin, Svetlana V. Anulova, Andrey A. Tremba, Pavel S. Shcherbakov:
Adaptive mirror descent algorithm for the minimization of expected cumulative losses driven by a renewal process. ECC 2015: 1195-1199 - 2014
- [c15]Alexander V. Nazin, Svetlana V. Anulova, Andrey A. Tremba:
Application of the Mirror Descent Method to minimize average losses coming by a poisson flow. ECC 2014: 2194-2197 - 2013
- [c14]Alexander V. Nazin, Boris M. Miller:
On effectiveness of the Mirror Decent Algorithm for a stochastic multi-armed bandit governed by a stationary finite Markov chain. AuCC 2013: 244-250 - [c13]Andrey A. Tremba, Alexander V. Nazin:
Extension of a saddle point mirror descent algorithm with application to robust PageRank. CDC 2013: 3691-3696 - [c12]Alexander V. Nazin, Boris M. Miller:
Mirror decent algorithm for a multi-armed bandit governed by a stationary finite state Markov chain. ECC 2013: 371-375 - [c11]Alexander V. Nazin, Boris M. Miller:
Robust Mirror Decent Algorithm for a Multi-Armed Bandit Governed by a Stationary Finite Markov Chain. MIM 2013: 905-909 - 2011
- [c10]Alexander V. Nazin, Boris M. Miller:
The mirror descent control algorithm for weakly regular homogeneous finite Markov chains with unknown mean losses. CDC/ECC 2011: 1779-1783 - 2010
- [c9]Alexander V. Nazin:
Estimating the principal eigenvector of a stochastic matrix: Mirror Descent Algorithms via game approach with application to PageRank problem. CDC 2010: 792-797 - 2009
- [c8]Alexander V. Nazin, Boris T. Polyak:
A randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank problem. CCA/ISIC 2009: 412-416 - [c7]Alexander V. Nazin, Boris T. Polyak:
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank. CDC 2009: 127-132 - 2006
- [c6]Boris T. Polyak, Alexander V. Nazin, Michael V. Topunov, Sergey A. Nazin:
Rejection of Bounded Disturbances via Invariant Ellipsoids Technique. CDC 2006: 1429-1434 - 2005
- [c5]Anatoli B. Juditsky, Alexander V. Nazin, Alexandre B. Tsybakov, Nicolas Vayatis:
Generalization Error Bounds for Aggregation by Mirror Descent with Averaging. NIPS 2005: 603-610 - 2003
- [c4]Jacob Roll, Alexander V. Nazin, Lennart Ljung:
Local modelling with a priori known bounds using direct weight optimization. ECC 2003: 2138-2143 - 2002
- [c3]Jacob Roll, Alexander V. Nazin, Lennart Ljung:
A non-asymptotic approach to local modelling. CDC 2002: 638-643 - [c2]Alex Poznyak, Alexander V. Nazin, Daishi Murano:
Suboptimal robust asymptotic observer for stochastic continuous time nonlinear system: numerical procedure and convergence analysis. CDC 2002: 2588-2593 - 1998
- [c1]Alexander V. Nazin, Vladimir Katkovnik:
On minimax lower bound for time-varying frequency estimation of harmonic signal. ICASSP 1998: 2213-2216
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
