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.
Random Projections for Semidefinite Programming
Manca B.;
2023-01-01
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
HAL-Random projections for semidefinite programming.pdf
Open Access dal 17/07/2024
Tipologia:
versione post-print (AAM)
Dimensione
308.93 kB
Formato
Adobe PDF
|
308.93 kB | Adobe PDF | Visualizza/Apri |
|
liberti-random_projections_for_semidefinite_programming.pdf
Solo gestori archivio
Tipologia:
versione editoriale (VoR)
Dimensione
172.14 kB
Formato
Adobe PDF
|
172.14 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
