Extracting dual solutions via primal optimizers

Cites work

A sublinear-time randomized approximation algorithm for matrix games
A whole new ball game: a primal accelerated method for matrix games and minimizing the maximum of smooth functions
scientific article; zbMATH DE number 46318 (Why is no real title available?)
scientific article; zbMATH DE number 1376935 (Why is no real title available?)
Information-based complexity of linear operator equations
Learning models with uniform performance via distributionally robust optimization
Lectures on convex optimization
Minimum cost flows, MDPs, and ℓ ₁ -regression in nearly linear time for dense instances
Multilevel Monte Carlo methods
Multilevel Monte Carlo Path Simulation
No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
On general minimax theorems
On optimality of Krylov's information when solving linear operator equations
Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions
Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization
Primal-dual accelerated gradient methods with small-dimensional relaxation oracle
Relative Lipschitzness in extragradient methods and a direct recipe for acceleration
Robust Stochastic Approximation Approach to Stochastic Programming
Solving linear programs in the current matrix multiplication time
Sublinear optimization for machine learning
Tensor methods for finding approximate stationary points of convex functions
The equivalence of linear programs and zero-sum games
Zur Theorie der Gesellschaftsspiele.

This page was built for publication: Extracting dual solutions via primal optimizers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296664)