An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
Journal of Applied Mathematics and Computing · 2024-06 · 70 (3) · 2129-2148
DOI: 10.1007/s12190-024-02041-3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Applied Mathematics and Computing, online erschienen am 23.03.2024. Verfasst von Billel Zaoui und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 31 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Zaoui, B., Benterki, D., & Yassine, A. (2024). An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization. Journal of Applied Mathematics and Computing, 70(3), 2129-2148. https://doi.org/10.1007/s12190-024-02041-3
Vancouver
Zaoui B, Benterki D, Yassine A. An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization. Journal of Applied Mathematics and Computing. 2024;70(3):2129-2148. doi:10.1007/s12190-024-02041-3
BibTeX
@article{Zaoui2024,
author = {Zaoui, Billel and Benterki, Djamel and Yassine, Adnan},
title = {An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization},
journal = {Journal of Applied Mathematics and Computing},
year = {2024},
volume = {70},
number = {3},
pages = {2129--2148},
doi = {10.1007/s12190-024-02041-3}
}
EUVIMED