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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Acta mathematica Sinica. English series Ročník 31; číslo 3; s. 543 - 556
Hlavný autor: Achache, Mohamed
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Heidelberg Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society 01.03.2015
Springer Nature B.V
Predmet:
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
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 barrier term. With this function we define a new search direction and also a new proximity function for analyzing its complexity. We show that if q1 〉 q2 〉 1, the algorithm has O（（q1 ＋ 1） nq1＋1/2（q1-q2）logn/ε）and O（（q1 ＋ 1）2（q1-q2）^3q1-2q2＋1√n logn/c） complexity results for large- and small-update methods, respectively.
Bibliografia:11-2039/O1
Semidefinite optimization, kernel functions, primal-dual interior point methods, large andsmall-update algorithms, complexity of algorithms
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 barrier term. With this function we define a new search direction and also a new proximity function for analyzing its complexity. We show that if q1 〉 q2 〉 1, the algorithm has O（（q1 ＋ 1） nq1＋1/2（q1-q2）logn/ε）and O（（q1 ＋ 1）2（q1-q2）^3q1-2q2＋1√n logn/c） complexity results for large- and small-update methods, respectively.
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1439-8516
1439-7617
DOI:10.1007/s10114-015-1314-4