Skip to content
DraconiticResearch
Search Sources API
194,230 studies31 sourcesUpdated 27 min ago
Peer-reviewedLicence not statedSIAM Journal on Scientific Computing

Fast Randomized Entropically Regularized Semidefinite Programming

  1. 1University of California, Berkeley and Lawrence Berkeley National Laboratory, Berkeley, CA 94720 USA

Related

  1. Bounds on the Semidefinite Programming Complexity of the Euclidean Ball
    Guanxi Li, Kevin Shu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Low-Rank and Lifted Semidefinite Programming for Mixed-Integer Polynomial Power Grid Optimization
    Samuel Chevalier
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Inexact PDHG for Large-Scale Semidefinite Programming
    Karthik Prakhya, Zimeng Wang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Spectral Deflation for Factorization-Free Matrix Filtering in Muon and Semidefinite Programming
    Haoran Sun, Shucheng Kang, Heng Yang
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingOptimisation & controlarXiv
  5. A Triangular Log-Det PDHG for Semidefinite Programming: Complementarity Selection and Global Linear Convergence
    Lijun Ding, Jinwen Yang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
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  -