An O (√nL) wide neighborhood interior-point algorithm for semidefinite optimization

被引：0
|
作者：
Pirhaji, M. [1 ]
Mansouri, H. [1 ]
Zangiabadi, M. [1 ]
机构：
[1] Shahrekord Univ, Fac Math Sci, Dept Appl Math, POB 115, Shahrekord, Iran
来源：
COMPUTATIONAL & APPLIED MATHEMATICS | 2017年 / 36卷 / 01期
关键词：
Semidefinite optimization; Interior-point methods; Wide neighborhood; Polynomial complexity; PATH-FOLLOWING METHOD; CONES;
D O I：
10.1007/s40314-015-0220-9
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we propose a primal-dual interior-point method for semidefinite optimization problems. The algorithm is based on a new class of search directions and the Ai-Zhang's wide neighborhood for monotone linear complementarity problems. The theoretical complexity of the new algorithm is calculated. It is investigated that the proposed algorithm has polynomial iteration complexity and coincides with the best known iteration bound for semidefinite optimization problems.
引用
收藏
页码：145 / 157
页数：13
相关论文
共 50 条
  • [21] A new primal-dual interior-point algorithm for semidefinite optimization
    Lee, Yong-Hoon
    Jin, Jin-Hee
    Cho, Gyeong-Mi
    2014 INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND APPLICATIONS (ICISA), 2014,
  • [22] A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
    Pirhaji, Mohammad
    Zangiabadi, Maryam
    Mansouri, Hossein
    TURKISH JOURNAL OF MATHEMATICS, 2017, 41 (01) : 168 - 185
  • [23] ON THE EXTENSION OF AN ARC-SEARCH INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION
    Kheirfam, Behrouz
    Moslemi, Morteza
    NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2018, 8 (02): : 261 - 275
  • [24] Two wide neighborhood interior-point methods for symmetric cone optimization
    Shahraki, M. Sayadi
    Mansouri, H.
    Zangiabadi, M.
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2017, 68 (01) : 29 - 55
  • [25] A wide neighborhood interior-point algorithm based on the trigonometric kernel function
    B. Kheirfam
    M. Haghighi
    Journal of Applied Mathematics and Computing, 2020, 64 : 119 - 135
  • [26] 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
  • [27] A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization
    Mansouri, H.
    Roos, C.
    NUMERICAL ALGORITHMS, 2009, 52 (02) : 225 - 255
  • [28] A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization
    H. Mansouri
    C. Roos
    Numerical Algorithms, 2009, 52 : 225 - 255
  • [29] A Polynomial-Iteration Infeasible Interior-Point Algorithm with Arc-Search for Semidefinite optimization
    B. Kheirfam
    Journal of Scientific Computing, 2021, 88
  • [30] A Polynomial-Iteration Infeasible Interior-Point Algorithm with Arc-Search for Semidefinite optimization
    Kheirfam, B.
    JOURNAL OF SCIENTIFIC COMPUTING, 2021, 88 (03)
12345