Solving LP using random projections

Research output: Contribution to journalArticlepeer-review

Abstract

A celebrated result of Johnson and Lindenstrauss asserts that, in high enough dimensional spaces, Euclidean distances defined by a finite set of points are approximately preserved when these points are projected to a certain lower dimensional space. We show that the distance from a point to a convex set is another approximate invariant, and leverage this result to approximately solve linear programs with a logarithmic number of rows.

Original languageEnglish
Pages (from-to)53-56
Number of pages4
JournalElectronic Notes in Discrete Mathematics
Volume55
DOIs
Publication statusPublished - 1 Nov 2016

Keywords

  • Johnson-Lindenstrauss lemma
  • random projection

Fingerprint

Dive into the research topics of 'Solving LP using random projections'. Together they form a unique fingerprint.

Cite this