Sciweavers

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

21

STOC
2002
ACM

favoriteEmaildiscussreport

73views Algorithms» more STOC 2002»

Solving convex programs by random walks

14 years 11 months ago

Solving convex programs by random walks

Download www-math.mit.edu

Dimitris Bertsimas, Santosh Vempala

Real-time Traffic

Algorithms | Convex Programs | STOC 2002 |

claim paper

Related Content

» Query by Committee Linear Separation and Random Walks

» Random walks on polytopes and an affine interior point method for linear programming

» Solving Markov Random Fields using Second Order Cone Programming Relaxations

» Fast Decoupling Capacitor Budgeting for PowerGround Network Using Random Walk Approach

» Efficiently solving convex relaxations for MAP estimation

» Convex relaxation approach to the identification of the WienerHammerstein model

» Dense Error Correction for LowRank Matrices via Principal Component Pursuit

» BoundsConsistent Local Search

» MessagePassing Algorithms for MAP Estimation Using DC Programming

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	STOC
Authors	Dimitris Bertsimas, Santosh Vempala

Comments (0)