A full Nesterov-Todd step feasible interior-point algorithm for semidefinite optimization based on a new hyperbolic barrier function
Journal of Information and Optimization Sciences · 2026 · 47 (4) · 1359-1376
DOI: 10.47974/jios-1604 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Information and Optimization Sciences, 2026. Verfasst von Safa Guerdouh und 1 weiteren Autor:innen.
Abstract (Originalsprache)
This study concerns solving semidefinite programming (SDP) problems using a new kernel-based primal-dual interior-point method (IPM). We propose a parameterized kernel function (KF) that has a hyperbolic barrier term. Taking advantage of the exponential convexity property of the new KF, we prove that the corresponding algorithm has a complexity of order n logn logne O(√n · log n · log(n/ε)) for large-update methods. To the best of our knowledge, this is the first hyperbolic KF for SDP to reach the best-known iteration bound for such methods.Preliminary numerical experiments indicate that the new KF is efficient compared with other existing KFs in the literature.
Zitieren
APA
Guerdouh, S., & Chikouche, W. (2026). A full Nesterov-Todd step feasible interior-point algorithm for semidefinite optimization based on a new hyperbolic barrier function. Journal of Information and Optimization Sciences, 47(4), 1359-1376. https://doi.org/10.47974/jios-1604
Vancouver
Guerdouh S, Chikouche W. A full Nesterov-Todd step feasible interior-point algorithm for semidefinite optimization based on a new hyperbolic barrier function. Journal of Information and Optimization Sciences. 2026;47(4):1359-1376. doi:10.47974/jios-1604
BibTeX
@article{Guerdouh2026,
author = {Guerdouh, Safa and Chikouche, Wided},
title = {A full Nesterov-Todd step feasible interior-point algorithm for semidefinite optimization based on a new hyperbolic barrier function},
journal = {Journal of Information and Optimization Sciences},
year = {2026},
volume = {47},
number = {4},
pages = {1359--1376},
doi = {10.47974/jios-1604}
}
EUVIMED