Pages that link to "Item:Q2029381"
From MaRDI portal
The following pages link to An accelerated directional derivative method for smooth stochastic convex optimization (Q2029381):
Displaying 12 items.
- Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems (Q2042418) (← links)
- A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
- Oracle complexity separation in convex optimization (Q2139268) (← links)
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization (Q2143221) (← links)
- Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle (Q2159456) (← links)
- Improved exploitation of higher order smoothness in derivative-free optimization (Q2162687) (← links)
- Accelerated directional search with non-Euclidean prox-structure (Q2290400) (← 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)
- Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs (Q6060563) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- Stochastic adversarial noise in the ``black box'' optimization problem (Q6588731) (← links)
