EUVIMEDEUVIMED entdecken
Crossref

Code and Data Repository for Alternating minimization for square root principal component pursuit

Shengxiang Deng, Xudong Li, Yangjing Zhang

INFORMS Journal on Computing · 24.11.2025

DOI: 10.1287/ijoc.2025.1105.cd ↗

Kurz gefasst

Fachartikel in der Zeitschrift INFORMS Journal on Computing, online erschienen am 24.11.2025. Verfasst von Shengxiang Deng und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The goal of this software is to demonstrate the effectiveness of our AltMin and Acc_AltMin methods proposed in this paper for solving the square root principal component pursuit problem.

Zitieren

APA

Deng, S., Li, X., & Zhang, Y. (2025). Code and Data Repository for Alternating minimization for square root principal component pursuit. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.2025.1105.cd

Vancouver

Deng S, Li X, Zhang Y. Code and Data Repository for Alternating minimization for square root principal component pursuit. INFORMS Journal on Computing. 2025. doi:10.1287/ijoc.2025.1105.cd

BibTeX
@article{Deng2025,
  author = {Deng, Shengxiang and Li, Xudong and Zhang, Yangjing},
  title = {Code and Data Repository for Alternating minimization for square root principal component pursuit},
  journal = {INFORMS Journal on Computing},
  year = {2025},
  doi = {10.1287/ijoc.2025.1105.cd}
}
Kostenlos starten →