An Interior Point Method for Semidefinite Programming based on New Kernel Functions

被引：0

作者：

Peyghami, M. Reza ^{[1
]}

机构：

[1] KN Toosi Univ Technol, Dept Sci, Tehran, Iran

来源：

MODELLING OF ENGINEERING AND TECHNOLOGICAL PROBLEMS | 2009年 / 1146卷

关键词：

Semidefinite programming; primal-dual interior-point method; large-update method; polynomial complexity; OPTIMIZATION;

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper we consider generic primal-dual methods for solving semidefinite programming problems based on a new class of kernel function defined on the positive definite cone. By using some appealing and mild conditions of the new class, we prove by simple analysis that the new class based large update primal-dual interior point methods enjoy an O (root nlogn logn/epsilon) iteration bound to solve semidefinite programming problems with special choice of parameters.

引用

页码：441 / 455

页数：15

共 23 条

[1] An interior point method for linear programming based on a class of kernel functions
Amini, K
Peyghami, MR
[J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2005, 71 (01) : 139 - 153
[2] Amini K., 2005, Southeast Asian Bull. Math., V29, P651
[3] [Anonymous], 1991, TOPICS MATRIX ANAL, DOI DOI 10.1017/CBO9780511840371
[4] [Anonymous], 1997, INTERIOR POINT ALGOR, DOI DOI 10.1002/9781118032701
[5] Bai Y.Q., 2002, P IND OPT S OPT DAY
[6] A new efficient large-update primal-dual interior-point method based on a finite barrier
Bai, YQ
El Ghami, M
Roos, C
[J]. SIAM JOURNAL ON OPTIMIZATION, 2003, 13 (03) : 766 - 782
[7] Bellman R, 1963, P S PURE MATH, P1
[8] DEKLERK E, 1997, THESIS DELFT U TECHN
[9] Gonzaga C.C., 1989, N. Megiddo. (Org.). Advances in Mathematical Programming-Interior Point and Related Methods, P1
[10] A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING
KARMARKAR, N
[J]. COMBINATORICA, 1984, 4 (04) : 373 - 395

← 1 2 3 →