Pages that link to "Item:Q2042418"
From MaRDI portal
The following pages link to Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems (Q2042418):
Displaying 16 items.
- Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems (Q2117629) (← links)
- Oracle complexity separation in convex optimization (Q2139268) (← links)
- Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle (Q2159456) (← links)
- Primal-dual stochastic distributed algorithm for constrained convex optimization (Q2334189) (← links)
- (Q5053256) (← links)
- An Optimal Algorithm for Decentralized Finite-Sum Optimization (Q5162661) (← links)
- Optimal Algorithms for Non-Smooth Distributed Optimization in Networks (Q5214253) (← links)
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method (Q5883312) (← links)
- Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches (Q6069998) (← links)
- A Decentralized Primal-Dual Method for Constrained Minimization of a Strongly Convex Function (Q6077139) (← links)
- Accelerated gradient methods with absolute and relative noise in the gradient (Q6087056) (← links)
- Inexact tensor methods and their application to stochastic convex optimization (Q6585820) (← links)
- Accelerated zero-order SGD method for solving the black box optimization problem under ``overparametrization'' condition (Q6588732) (← links)
- Optimal gradient tracking for decentralized optimization (Q6608029) (← links)
- The ``black-box'' optimization problem: zero-order accelerated stochastic method via kernel approximation (Q6655796) (← links)
- An accelerated decentralized stochastic optimization algorithm with inexact model (Q6664887) (← links)
