Peer-reviewedLicence not statedSIAM Journal on Scientific Computing
Fast Randomized Entropically Regularized Semidefinite Programming
- 1University of California, Berkeley and Lawrence Berkeley National Laboratory, Berkeley, CA 94720 USA
Related
- Bounds on the Semidefinite Programming Complexity of the Euclidean Ball
- Low-Rank and Lifted Semidefinite Programming for Mixed-Integer Polynomial Power Grid Optimization
- Inexact PDHG for Large-Scale Semidefinite Programming
- Spectral Deflation for Factorization-Free Matrix Filtering in Muon and Semidefinite Programming
- A Triangular Log-Det PDHG for Semidefinite Programming: Complementarity Selection and Global Linear Convergence
BibTeX
@article{lindsey2026fast,
title = {{Fast Randomized Entropically Regularized Semidefinite Programming}},
author = {Michael Lindsey},
journal = {SIAM Journal on Scientific Computing},
year = {2026},
month = jul,
doi = {10.1137/25m1773982},
url = {http://arxiv.org/abs/2303.12133},
}
RIS
TY - JOUR
TI - Fast Randomized Entropically Regularized Semidefinite Programming
AU - Michael Lindsey
PY - 2026
DA - 2026/07/30
JO - SIAM Journal on Scientific Computing
DO - 10.1137/25m1773982
UR - http://arxiv.org/abs/2303.12133
SN - 1064-8275
SN - 1095-7197
ER -