Complexity Analysis of an Interior Point Algorithm for the Semidefinite Optimization Based on a Kernel Function with a Double Barrier Term

In this paper, we establish the polynomial complexity of a primal-dual path-following interior point algorithm for solving semidefinite optimization（SDO） problems. The proposed algorithm is based on a new kernel function which differs from the existing kernel functions in which it has a double barri...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Acta mathematica Sinica. English series Jg. 31; H. 3; S. 543 - 556
1. Verfasser:	Achache, Mohamed
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Heidelberg Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society 01.03.2015 Springer Nature B.V
Schlagworte:	Algorithms Barriers Complexity Eigenvalues Functions (mathematics) Kernel functions Mathematical analysis Mathematical programming Mathematics Mathematics and Statistics Optimization Polynomials Semidefinite programming Studies Texts 优化内核函数内点算法复杂性分析多项式复杂性屏障期限路径跟踪 kernel functions 90C51 65K05 complexity of algorithms 90C25 90C22 Semidefinite optimization primal-dual interior point methods large and small-update algorithms
ISSN:	1439-8516, 1439-7617
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!