Pages that link to "Item:Q510299"
From MaRDI portal
The following pages link to Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex (Q510299):
Displaying 10 items.
- Gradient-free two-point methods for solving stochastic nonsmooth convex optimization problems with small non-random noises (Q1616222) (← links)
- An accelerated directional derivative method for smooth stochastic convex optimization (Q2029381) (← links)
- On the upper bound for the expectation of the norm of a vector uniformly distributed on the sphere and the phenomenon of concentration of uniform measure on the sphere (Q2282831) (← links)
- Accelerated directional search with non-Euclidean prox-structure (Q2290400) (← links)
- Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case (Q2397263) (← links)
- Gradient-Free Methods with Inexact Oracle for Convex-Concave Stochastic Saddle-Point Problem (Q4965105) (← links)
- Stochastic approximation versus sample average approximation for Wasserstein barycenters (Q5058387) (← links)
- An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization (Q5081777) (← links)
- Gradient-free federated learning methods with \(l_1\) and \(l_2\)-randomization for non-smooth convex stochastic optimization problems (Q6053598) (← links)
- Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact (Q6060544) (← links)
