Pages that link to "Item:Q5085148"
From MaRDI portal
The following pages link to Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems (Q5085148):
Displaying 8 items.
- New Primal-Dual Algorithms for a Class of Nonsmooth and Nonlinear Convex-Concave Minimax Problems (Q5043287) (← links)
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method (Q5883312) (← links)
- A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems (Q6097769) (← links)
- Accelerated variance-reduced methods for saddle-point problems (Q6114960) (← links)
- Robust Accelerated Primal-Dual Methods for Computing Saddle Points (Q6130545) (← links)
- Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games (Q6191973) (← links)
- General procedure to provide high-probability guarantees for stochastic saddle point problems (Q6569676) (← links)
- Practical acceleration of the Condat-Vũ algorithm (Q6666618) (← links)
