Pages that link to "Item:Q4915174"
From MaRDI portal
The following pages link to Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework (Q4915174):
Displaying 37 items.
- Simple and Optimal Methods for Stochastic Variational Inequalities, II: Markovian Noise and Policy Evaluation in Reinforcement Learning (Q5081106) (← links)
- Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems (Q5085148) (← links)
- (Q5096506) (← links)
- On the rates of convergence of parallelized averaged stochastic gradient algorithms (Q5110810) (← links)
- (Q5148937) (← links)
- (Q5149264) (← links)
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity (Q5233106) (← links)
- Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
- Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning (Q5254990) (← links)
- Two stochastic optimization algorithms for convex optimization with fixed point constraints (Q5379458) (← links)
- Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization (Q5737735) (← links)
- Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions (Q5853717) (← links)
- Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs (Q5870771) (← links)
- <i>L</i><sup><i>p</i></sup> and almost sure rates of convergence of averaged stochastic gradient algorithms: locally strongly convex objective (Q5881051) (← links)
- On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error (Q5882219) (← links)
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization (Q5962715) (← links)
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization (Q5962719) (← links)
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming (Q5962727) (← links)
- A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems (Q6051310) (← links)
- Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs (Q6060563) (← links)
- Universal Conditional Gradient Sliding for Convex Optimization (Q6071883) (← links)
- An overview of stochastic quasi-Newton methods for large-scale machine learning (Q6097379) (← links)
- Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization (Q6116247) (← links)
- Optimal Algorithms for Stochastic Complementary Composite Minimization (Q6136660) (← links)
- Theoretical analysis of Adam using hyperparameters close to one without Lipschitz smoothness (Q6145578) (← links)
- Nonlinear Gradient Mappings and Stochastic Optimization: A General Framework with Applications to Heavy-Tail Noise (Q6155875) (← links)
- Block mirror stochastic gradient method for stochastic optimization (Q6158991) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- Differentially private inference via noisy optimization (Q6183772) (← links)
- Reliable Error Estimates for Optimal Control of Linear Elliptic PDEs with Random Inputs (Q6188687) (← links)
- On optimal universal first-order methods for minimizing heterogeneous sums (Q6191975) (← links)
- Adaptive proximal SGD based on new estimating sequences for sparser ERM (Q6196471) (← links)
- Algorithms with gradient clipping for stochastic optimization with heavy-tailed noise (Q6204268) (← links)
- Momentum-based accelerated mirror descent stochastic approximation for robust topology optimization under stochastic loads (Q6554079) (← links)
- Online composite optimization with time-varying regularizers (Q6559338) (← links)
- High-probability complexity bounds for non-smooth stochastic convex optimization with heavy-tailed noise (Q6655806) (← links)
- A proximal stochastic quasi-Newton algorithm with dynamical sampling and stochastic line search (Q6655883) (← links)