Polynomial primal-dual affine scaling algorithms in semidefinite programming

被引：4

作者：

De Klerk, E ^{[1
]}

Roos, C ^{[1
]}

Terlaky, T ^{[1
]}

机构：

[1] Delft Univ Technol, Fac Tech Math & Informat, NL-2600 GA Delft, Netherlands

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 1998年 / 2卷 / 01期

关键词：

interior-point method; primal-dual method; semidefinite programming; affine scaling; Dikin steps;

D O I：

10.1023/A:1009791827917

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Two primal-dual affine scaling algorithms for linear programming are extended to semidefinite programming. The algorithms do not require (nearly) centered starting solutions, and can be initiated with any primal-dual feasible solution. The first algorithm is the Dikin-type affine Scaling method of Jansen et al. (1993b) and the second the classical affine scaling method of Monteiro et al. (1990). The extension of the former has a worst-case complexity bound of 0(tau(0)nL) iterations, where tau(0) is a measure of centrality of the the starting solution, and the latter a bound of 0(tau(0)nL(2)) iterations.

引用

页码：51 / 69

页数：19

共 50 条

[1] Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming
E. de Klerk
C. Roos
T. Terlaky
Journal of Combinatorial Optimization, 1998, 2 : 51 - 69
[2] Polynomial primal-dual cone affine scaling for semidefinite programming
Berkelaar, AB
Sturm, JF
Zhang, SZ
APPLIED NUMERICAL MATHEMATICS, 1999, 29 (03) : 317 - 333
[3] Primal-dual affine-scaling algorithms fail for semidefinite programming
Muramatsu, M
Vanderbei, RJ
MATHEMATICS OF OPERATIONS RESEARCH, 1999, 24 (01) : 149 - 175
[4] Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming
Monteiro, RDC
Tsuchiya, T
SIAM JOURNAL ON OPTIMIZATION, 1999, 9 (03) : 551 - 577
[5] Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
Fac. of Tech. Math. and Informatics, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, Netherlands
Appl Numer Math, 3 (335-360):
[6] Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
de Klerk, E
Roos, C
Terlaky, T
APPLIED NUMERICAL MATHEMATICS, 1999, 29 (03) : 335 - 360
[7] SUPERLINEAR PRIMAL-DUAL AFFINE SCALING ALGORITHMS FOR LCP
MONTEIRO, RDC
WRIGHT, SJ
MATHEMATICAL PROGRAMMING, 1995, 69 (02) : 311 - 333
[8] Primal-dual path-following algorithms for semidefinite programming
Monteiro, RDC
SIAM JOURNAL ON OPTIMIZATION, 1997, 7 (03) : 663 - 678
[9] Polynomial convergence of primal-dual algorithms for semidefinite programming based on the Monteiro and Zhang family of directions
Monteiro, RDC
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) : 797 - 812
[10] A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
Ali Mohammad-Nezhad
Tamás Terlaky
Computational Optimization and Applications, 2017, 66 : 577 - 600

← 1 2 3 4 5 →