Pages that link to "Item:Q431003"
From MaRDI portal
The following pages link to First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003):
Displaying 11 items.
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- Subgradient methods for huge-scale optimization problems (Q403646) (← links)
- Forward-partial inverse-forward splitting for solving monotone inclusions (Q493060) (← links)
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678) (← links)
- Algorithm for computing approximate Nash equilibrium in continuous games with application to continuous blotto (Q2052549) (← links)
- Faster algorithms for extensive-form game solving via improved smoothing functions (Q2288198) (← links)
- Faster subgradient methods for functions with Hölderian growth (Q2297653) (← links)
- A simple nearly optimal restart scheme for speeding up first-order methods (Q2696573) (← links)
- Towards a deeper geometric, analytic and algorithmic understanding of margins (Q2815511) (← links)
- Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)
