Touil, İmeneChikouche, Wided2024-07-122024-07-122019Touil, İ. ve Chikouche, W. (2019). Complexity analysis of primal-dual interior point methods for semidefinite programming based on a new kernel function with an hyperbolic barrier term. International Conference of Mathematical Sciences (ICMS 2019). s. 93.978-605-2124-29-1https://hdl.handle.net/20.500.12415/2078In this paper, we present a new primal-dual interior point algorithm for SDP problems based on a new kernel function. By simple analysis, we derive the iteration bounds O ( n 3 4 ln n ? ) for large-update methods and O (? n ln n ? ) for small-update methods. These results match the currently best known iteration bounds for large- and small-update methods based on the hyperbolic kernel functions.enCC0 1.0 Universalinfo:eu-repo/semantics/openAccessSemidefinite programmingPrimal-dual IPMsComplexity analysisArticle9393