Pages that link to "Item:Q5300524"
From MaRDI portal
The following pages link to Stochastic Convex Optimization with Bandit Feedback (Q5300524):
Displaying 11 items.
- Operations research applications of dichotomous search (Q1681128) (← links)
- Exploratory distributions for convex functions (Q1737974) (← links)
- Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm (Q2091834) (← links)
- Random gradient-free minimization of convex functions (Q2397749) (← links)
- Zeroth-order feedback optimization for cooperative multi-agent systems (Q2682294) (← links)
- Non-Stationary Stochastic Optimization (Q2795881) (← links)
- Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models (Q5026455) (← links)
- An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization (Q5081777) (← links)
- Technical Note—Nonstationary Stochastic Optimization Under <i>L</i><sub><i>p,q</i></sub>-Variation Measures (Q5129221) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Technical note: <scp>Finite‐time</scp> regret analysis of <scp>Kiefer‐Wolfowitz</scp> stochastic approximation algorithm and nonparametric <scp>multi‐product</scp> dynamic pricing with unknown demand (Q6072149) (← links)
