EUVIMEDEUVIMED entdecken
Crossref

Fast Randomized Entropically Regularized Semidefinite Programming

Michael Lindsey

SIAM Journal on Scientific Computing · 31.08.2026 · 48 (4) · A2085-A2104

DOI: 10.1137/25m1773982 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SIAM Journal on Scientific Computing, online erschienen am 30.07.2026. Verfasst von Michael Lindsey. Die Arbeit nennt 26 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We develop a practical approach to semidefinite programming (SDP) that includes the von Neumann entropy, or an appropriate variant, as a regularization term. In particular we solve the dual of the regularized program, demonstrating how a carefully chosen randomized trace estimator can be used to estimate dual gradients effectively. We also introduce specialized optimization approaches for common SDP, specifically SDP with diagonal constraint and the problem of the determining the spectral projector onto the span of extremal eigenvectors. We validate our approach on such problems with applications to combinatorial optimization and spectral embedding.

Zitieren

APA

Lindsey, M. (2026). Fast Randomized Entropically Regularized Semidefinite Programming. SIAM Journal on Scientific Computing, 48(4), A2085-A2104. https://doi.org/10.1137/25m1773982

Vancouver

Lindsey M. Fast Randomized Entropically Regularized Semidefinite Programming. SIAM Journal on Scientific Computing. 2026;48(4):A2085-A2104. doi:10.1137/25m1773982

BibTeX
@article{Lindsey2026,
  author = {Lindsey, Michael},
  title = {Fast Randomized Entropically Regularized Semidefinite Programming},
  journal = {SIAM Journal on Scientific Computing},
  year = {2026},
  volume = {48},
  number = {4},
  pages = {A2085--A2104},
  doi = {10.1137/25m1773982}
}
Kostenlos starten →