A POLYNOMIAL-TIME INTERIOR-POINT ALGORITHM FOR CONVEX QUADRATIC SEMIDEFINITE OPTIMIZATION

被引：5

作者：

Bai, Y. Q. ^{[1
]}

Wang, F. Y. ^{[1
]}

Luo, X. W. ^{[1
]}

机构：

[1] Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China

来源：

RAIRO-OPERATIONS RESEARCH | 2010年 / 44卷 / 03期

基金：

中国国家自然科学基金;

关键词：

Convex quadratic semidefinite optimization; interior-point algorithm; small-update method; iteration bound; polynomial-time; SDP;

D O I：

10.1051/ro/2010016

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper we propose a primal-dual interior-point algorithm for convex quadratic semidefinite optimization problem. The search direction of algorithm is defined in terms of a matrix function and the iteration is generated by full-Newton step. Furthermore, we derive the iteration bound for the algorithm with small-update method, namely, O(root n log n/epsilon), which is best-known bound so far.

引用

页码：251 / 265

页数：15

共 50 条

[31] Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
Hayato Waki
Maho Nakata
Masakazu Muramatsu
Computational Optimization and Applications, 2012, 53 : 823 - 844
[32] A Primal-Dual Interior-Point Algorithm for Convex Quadratic Optimization Based on A Parametric Kernel Function
Wang, Guoqiang
Bai, Yanqin
INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 2, PROCEEDINGS, 2009, : 748 - +
[33] Solving convex quadratic programming by potential-reduction interior-point algorithm
Liang Xi-ming
Ma Long-hua
Qian Ji-xin
Journal of Zhejiang University-SCIENCE A, 2001, 2 (1): : 66 - 70
[34] AN INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A NEW PARAMETRIC KERNEL FUNCTION
Fathi-Hafshejani, Sajad
Fakharzadeh, Alireza
JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS, 2018,
[35] A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION
Pirhaji, Mohammad
Mansouri, Hosseino
Zangiabadi, Maryam
RAIRO-OPERATIONS RESEARCH, 2017, 51 (03) : 533 - 545
[36] Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming
Recht, P.
Schade, Ph.
OPTIMIZATION, 2007, 56 (04) : 495 - 514
[37] SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM
梁昔明
马龙华
钱积新
Journal of Zhejiang University Science, 2001, (01) : 67 - 71
[38] Complexity analysis and numerical implementation of a new interior-point algorithm for semidefinite optimization
Zaoui, Billel
Benterki, Djamel
Khelladi, Samia
OPERATIONS RESEARCH LETTERS, 2024, 57
[39] A polynomial interior-point algorithm with improved iteration bounds for linear optimization
Liying Liu
Tao Hua
Japan Journal of Industrial and Applied Mathematics, 2024, 41 : 739 - 756
[40] A polynomial interior-point algorithm with improved iteration bounds for linear optimization
Liu, Liying
Hua, Tao
JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2024, 41 (02) : 739 - 756

← 1 2 3 4 5 →