Skip to main navigation Skip to search Skip to main content

Practical Performance of Random Projections in Linear Programming

  • Department of Mathematics and Computer Science
  • Universitá di Cagliari
  • RIKEN AIP

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Citations (Scopus)

Abstract

The use of random projections in mathematical programming allows standard solution algorithms to solve instances of much larger sizes, at least approximately. Approximation results have been derived in the relevant literature for many specific problems, as well as for several mathematical programming subclasses. Despite the theoretical developments, it is not always clear that random projections are actually useful in solving mathematical programs in practice. In this paper we provide a computational assessment of the application of random projections to linear programming.

Original languageEnglish
Title of host publication20th International Symposium on Experimental Algorithms, SEA 2022
EditorsChristian Schulz, Bora Ucar
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772518
DOIs
Publication statusPublished - 1 Jul 2022
Event20th International Symposium on Experimental Algorithms, SEA 2022 - Heidelberg, Germany
Duration: 25 Jul 2022 → 27 Jul 2022

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume233
ISSN (Print)1868-8969

Conference

Conference20th International Symposium on Experimental Algorithms, SEA 2022
Country/TerritoryGermany
CityHeidelberg
Period25/07/22 → 27/07/22

Keywords

  • Computational testing
  • Johnson-Lindenstrauss Lemma
  • Linear Programming

Fingerprint

Dive into the research topics of 'Practical Performance of Random Projections in Linear Programming'. Together they form a unique fingerprint.

Cite this