Almost sure convergence of randomised-difference descent algorithm for stochastic convex optimisation
From MaRDI portal
Cites work
- A Kiefer-Wolfowitz algorithm with randomized differences
- A Stochastic Approximation Method
- Acceleration of Stochastic Approximation by Averaging
- Adaptive subgradient methods for online learning and stochastic optimization
- An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
- Asymptotically efficient stochastic approximation; the RM case
- Distributed optimisation design for solving the Stein equation with constraints
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- Gittins index based control policy for a class of pursuit-evasion problems
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 1972910 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Logarithmic regret algorithms for online convex optimization
- Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Random gradient-free minimization of convex functions
- Recursive identification and parameter estimation
- Stochastic Estimation of the Maximum of a Regression Function
This page was built for publication: Almost sure convergence of randomised-difference descent algorithm for stochastic convex optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022921)
