Pages that link to "Item:Q1785198"

The following pages link to An optimal randomized incremental gradient method (Q1785198):

Displaying 31 items.

• Dynamic stochastic approximation for multi-stage stochastic optimization (Q2020613) (← links)
• Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems (Q2042418) (← links)
• Network manipulation algorithm based on inexact alternating minimization (Q2109010) (← links)
• Accelerating variance-reduced stochastic gradient methods (Q2118092) (← links)
• Oracle complexity separation in convex optimization (Q2139268) (← links)
• Accelerating incremental gradient optimization with curvature information (Q2181597) (← links)
• Linear convergence of cyclic SAGA (Q2193004) (← links)
• Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems (Q2220653) (← links)
• Communication-efficient algorithms for decentralized and stochastic optimization (Q2297648) (← links)
• Stochastic first-order methods for convex and nonconvex functional constrained optimization (Q2689819) (← links)
• Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice (Q4558545) (← links)
• Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization (Q4636997) (← links)
• (Q4637046) (← links)
• On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent (Q4969070) (← links)
• (Q4969259) (← links)
• (Q4969260) (← links)
• (Q4998940) (← links)
• On the Convergence of Stochastic Primal-Dual Hybrid Gradient (Q5081780) (← links)
• Accelerated dual-averaging primal–dual method for composite convex minimization (Q5135253) (← links)
• (Q5148937) (← links)
• An Optimal Algorithm for Decentralized Finite-Sum Optimization (Q5162661) (← links)
• Accelerated Stochastic Algorithms for Nonconvex Finite-Sum and Multiblock Optimization (Q5242931) (← links)
• Excessive Gap Technique in Nonsmooth Convex Minimization (Q5317557) (← links)
• Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems (Q5885824) (← links)
• Optimal Methods for Convex Risk-Averse Distributed Optimization (Q6116242) (← links)
• Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization (Q6116247) (← links)
• No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization (Q6126650) (← links)
• Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence (Q6161312) (← links)
• Data-Driven Mirror Descent with Input-Convex Neural Networks (Q6171691) (← links)
• An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems (Q6182323) (← links)
• Perseus: a simple and optimal high-order method for variational inequalities (Q6665392) (← links)