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] AN INTERIOR-POINT METHOD FOR SYMMETRIC OPTIMIZATION BASED ON A NEW WIDE NEIGHBORHOOD
    Kheirfam, Behrouz
    PACIFIC JOURNAL OF OPTIMIZATION, 2020, 16 (04): : 625 - 640
  • [22] 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
  • [23] A wide neighborhood interior-point algorithm based on the trigonometric kernel function
    Kheirfam, B.
    Haghighi, M.
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2020, 64 (1-2) : 119 - 135
  • [24] Two wide neighborhood interior-point methods for symmetric cone optimization
    M. Sayadi Shahraki
    H. Mansouri
    M. Zangiabadi
    Computational Optimization and Applications, 2017, 68 : 29 - 55
  • [25] 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
  • [26] 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,
  • [27] 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
  • [28] A POLYNOMIAL-TIME INTERIOR-POINT ALGORITHM FOR CONVEX QUADRATIC SEMIDEFINITE OPTIMIZATION
    Bai, Y. Q.
    Wang, F. Y.
    Luo, X. W.
    RAIRO-OPERATIONS RESEARCH, 2010, 44 (03) : 251 - 265
  • [29] 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
  • [30] 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
12345