Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

98

SEAL
2010
Springer

138views Machine Learning» more SEAL 2010»

A Parallel Algorithm for Solving Large Convex Minimax Problems

15 years 22 days ago

A Parallel Algorithm for Solving Large Convex Minimax Problems

Download cims.nyu.edu

Ramnik Arora, Utkarsh Upadhyay, Rupesh Tulshyan, J

Real-time Traffic

Machine Learning | SEAL 2010 |

claim paper

Related Content

» Parametric regret in uncertain Markov decision processes

» Finding Optimal Strategies for Imperfect Information Games

» Solving LargeScale QAP Problems in Parallel with the Search Library ZRAM

» Solving Large Irregular Graph Problems Using Adaptive WorkStealing

» A scalable modular convex solver for regularized risk minimization

» Convex variational Bayesian inference for large scale generalized linear models

» Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm

» Approximate methods for convex minimization problems with seriesparallel structure

» A Gridenabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimizatio...

Post Info
More Details (n/a)

Added	14 Feb 2011
Updated	14 Feb 2011
Type	Journal
Year	2010
Where	SEAL
Authors	Ramnik Arora, Utkarsh Upadhyay, Rupesh Tulshyan, Joydeep Dutta

Comments (0)