Complexity analysis of primal-dual interior point methods for semidefinite programming based on a new kernel function with an hyperbolic barrier term
Küçük Resim Yok
Tarih
2019
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
In 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.
Açıklama
Anahtar Kelimeler
Semidefinite programming, Primal-dual IPMs, Complexity analysis
Kaynak
International Conference of Mathematical Sciences (ICMS 2019)
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Touil, İ. 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.
