Crossref
Complexity Analysis of a Primal-Dual Interior-Point Method for Convex Quadratic Programming with a New Exponential Logarithmic Kernel
Asia Pacific Journal of Mathematics · 2026 · 13 · 109
DOI: 10.28924/apjm/13-109 ↗Kurz gefasst
Fachartikel in der Zeitschrift Asia Pacific Journal of Mathematics, 2026. Verfasst von Belkacem Chenaf.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Chenaf, B. (2026). Complexity Analysis of a Primal-Dual Interior-Point Method for Convex Quadratic Programming with a New Exponential Logarithmic Kernel. Asia Pacific Journal of Mathematics, 13, 109. https://doi.org/10.28924/apjm/13-109
Vancouver
Chenaf B. Complexity Analysis of a Primal-Dual Interior-Point Method for Convex Quadratic Programming with a New Exponential Logarithmic Kernel. Asia Pacific Journal of Mathematics. 2026;13:109. doi:10.28924/apjm/13-109
BibTeX
@article{Chenaf2026,
author = {Chenaf, Belkacem},
title = {Complexity Analysis of a Primal-Dual Interior-Point Method for Convex Quadratic Programming with a New Exponential Logarithmic Kernel},
journal = {Asia Pacific Journal of Mathematics},
year = {2026},
volume = {13},
pages = {109},
doi = {10.28924/apjm/13-109}
}
EUVIMED