Pages that link to "Item:Q5257146"
From MaRDI portal
The following pages link to A stochastic algorithm with optimal convergence rate for strongly convex optimization problems (Q5257146):
Displaying 11 items.
- Almost sure convergence of extremum seeking algorithm using stochastic perturbation (Q313311) (← links)
- A zeroth order method for stochastic weakly convex optimization (Q2057220) (← links)
- A linearly convergent stochastic recursive gradient method for convex optimization (Q2228399) (← links)
- Stochastic intermediate gradient method for convex optimization problems (Q2631196) (← links)
- Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization (Q2696952) (← links)
- Dual averaging methods for regularized stochastic learning and online optimization (Q2896156) (← links)
- (Q4262858) (← links)
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework (Q4915174) (← links)
- (Q4998940) (← links)
- (Q5432767) (← links)
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization (Q5741072) (← links)
