Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex (Q510299): Difference between revisions

@@ Property / cites work @@
+Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
+Normal rank
@@ Property / cites work @@
+Q2925334
@@ Property / cites work: Q2925334 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Stochastic Approximation Approach to Stochastic Programming
+Normal rank
@@ Property / cites work @@
+Introduction to Stochastic Search and Optimization
+Normal rank
@@ Property / cites work @@
+Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
+Normal rank
@@ Property / cites work @@
+Lectures on Modern Convex Optimization
@@ Property / cites work: Lectures on Modern Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Extremes and related properties of random sequences and processes
+Normal rank
@@ Property / cites work @@
+Q2756809
@@ Property / cites work: Q2756809 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4907706
@@ Property / cites work: Q4907706 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3920436
@@ Property / cites work: Q3920436 / rank @@
+Normal rank
@@ Property / cites work @@
+Coordinate descent algorithms
@@ Property / cites work: Coordinate descent algorithms / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s0005117916110114
+Normal rank
@@ Property / OpenAlex ID @@
+W2554066544
@@ Property / OpenAlex ID: W2554066544 / rank @@
+Normal rank