Optimal order of accuracy of search algorithms in stochastic optimization

From MaRDI portal
Publication:749450

zbMath0712.90073MaRDI QIDQ749450

Alexandre B. Tsybakov, Boris T. Polyak

Publication date: 1990

Published in: Problems of Information Transmission (Search for Journal in Brave)




Related Items (17)

Stopping rules for optimization algorithms based on stochastic approximationStochastic approximation of global minimum pointsImproved exploitation of higher order smoothness in derivative-free optimizationAlgorithm for stochastic approximation with trial input perturbation in the nonstationary problem of optimizationAn Accelerated Method for Derivative-Free Smooth Stochastic Convex OptimizationBayesian mode and maximum estimation and accelerated rates of contractionNon-smooth setting of stochastic decentralized convex optimization problem over time-varying graphsAccelerated gradient methods with absolute and relative noise in the gradientRe-thinking high-dimensional mathematical statistics. Abstracts from the workshop held May 15--21, 2022Estimation and inference for minimizer and minimum of convex functions: optimality, adaptivity and uncertainty principlesAccelerated randomized stochastic optimization.A companion for the Kiefer-Wolfowitz-Blum stochastic approximation algorithmA randomized stochastic optimization algorithm: its estimation accuracyStochastic approximation algorithm with randomization at the input for unsupervised parameters estimation of Gaussian mixture model with sparse parametersOptimal two-stage procedures for estimating location and size of the maximum of a multivariate regression functionStochastic approximation search algorithms with randomization at the inputThe stochastic approximation method for the estimation of a multivariate probability density






This page was built for publication: Optimal order of accuracy of search algorithms in stochastic optimization