Skip to main navigation Skip to search Skip to main content

Random Projections for Semidefinite Programming

  • Leo Liberti
  • , Benedetto Manca
  • , Antoine Oustry
  • , Pierre Louis Poirion
  • Universitá di Cagliari
  • Laboratoire d'Informatique (LIX)
  • RIKEN AIP

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Random projections can reduce the dimensionality of point sets while keeping approximate congruence. Applying random projections to optimization problems raises many theoretical and computational issues. Most of the theoretical issues in the application of random projections to conic programming were addressed in Liberti et al. (Linear Algebr. Appl. 626:204–220, 2021) [1]. This paper focuses on semidefinite programming.

Original languageEnglish
Title of host publicationAIRO Springer Series
PublisherSpringer Nature
Pages97-108
Number of pages12
DOIs
Publication statusPublished - 1 Jan 2023

Publication series

NameAIRO Springer Series
Volume9
ISSN (Print)2523-7047
ISSN (Electronic)2523-7055

Fingerprint

Dive into the research topics of 'Random Projections for Semidefinite Programming'. Together they form a unique fingerprint.

Cite this