Optimal methods for convex nested stochastic composite optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3761782 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization
- A Stochastic Subgradient Method for Nonsmooth Nonconvex Multilevel Composition Optimization
- A proximal method for composite minimization
- Accelerating Stochastic Composition Optimization
- An optimal method for stochastic composite optimization
- An optimal randomized incremental gradient method
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Convex Analysis
- First-order and stochastic optimization methods for machine learning
- First-order methods in optimization
- Gradient sliding for composite optimization
- Multilevel stochastic gradient methods for nested composition optimization
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Optimal primal-dual methods for a class of saddle point problems
- Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization. II: Shrinking procedures and optimal algorithms
- Random gradient extrapolation for distributed and stochastic optimization
- Smooth minimization of non-smooth functions
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
- Stochastic multilevel composition optimization algorithms with level-independent convergence rates
This page was built for publication: Optimal methods for convex nested stochastic composite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962867)