scientific article; zbMATH DE number 7626794
From MaRDI portal
Publication:5053317
Publication date: 6 December 2022
Full work available at URL: https://arxiv.org/abs/2007.09532
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule
- Logarithmic regret algorithms for online convex optimization
- Introductory lectures on convex optimization. A basic course.
- Stochastic Network Optimization with Application to Communication and Queueing Systems
- An optimal algorithm for stochastic strongly-convex optimization
- Efficient Robbins-Monro procedure for binary data
- Stopped Random Walks
- Robust Stochastic Approximation Approach to Stochastic Programming
- Acceleration of Stochastic Approximation by Averaging
- Bandits with Knapsacks
- Applied Probability and Queues
- 10.1162/153244303321897663
- The Proximal Robbins–Monro Method
- Asynchronous Optimization over Weakly Coupled Renewal Systems
- Dynamic Optimization and Learning for Renewal Systems
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Markov Renewal Programming by Linear Fractional Programming
- A Stochastic Approximation Method
- Fractional programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
