Pages that link to "Item:Q1919166"

The following pages link to A sublinear-time randomized approximation algorithm for matrix games (Q1919166):

Displaying 26 items.

• Algorithm portfolios for noisy optimization (Q276539) (← links)
• Sublinear time algorithms for approximate semidefinite programming (Q304246) (← links)
• A nearly linear-time PTAS for explicit fractional packing and covering linear programs (Q487021) (← links)
• Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
• Limits of local search: quality and efficiency (Q527441) (← links)
• On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
• Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
• Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
• Adaptive game playing using multiplicative weights (Q1818286) (← links)
• Fast quantum subroutines for the simplex method (Q2061891) (← links)
• Computer science and decision theory (Q2271874) (← links)
• Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
• On the efficiency of a randomized mirror descent algorithm in online optimization problems (Q2354481) (← links)
• The complexity of linear programming in \((\gamma ,\kappa )\)-form (Q2380073) (← links)
• A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs (Q2414864) (← links)
• Randomized first order algorithms with applications to \(\ell _{1}\)-minimization (Q2434980) (← links)
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
• A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs (Q2971158) (← links)
• Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design (Q3449585) (← links)
• (Q5020878) (← links)
• Efficient numerical methods to solve sparse linear equations with application to PageRank (Q5043846) (← links)
• Finding Sparse Solutions for Packing and Covering Semidefinite Programs (Q5071107) (← links)
• Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs (Q5075785) (← links)
• Solving variational inequalities with Stochastic Mirror-Prox algorithm (Q5168840) (← links)
• On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms (Q5252231) (← links)
• Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control'' (Q5966128) (← links)