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 条
  • [31] A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization
    H. Mansouri
    C. Roos
    Numerical Algorithms, 2009, 52 : 225 - 255
  • [32] An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood
    Behrouz Kheirfam
    Naser Osmanpour
    Mohammad Keyanpour
    Numerical Algorithms, 2021, 88 : 143 - 163
  • [33] An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood
    Kheirfam, Behrouz
    Osmanpour, Naser
    Keyanpour, Mohammad
    NUMERICAL ALGORITHMS, 2021, 88 (01) : 143 - 163
  • [34] A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
    Wang, Weiwei
    Liu, Hongwei
    Bi, Hongmei
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2019, 96 (10) : 1979 - 1992
  • [35] LARGE-UPDATE PRIMAL-DUAL INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION
    Cho, Gyeong-Mi
    PACIFIC JOURNAL OF OPTIMIZATION, 2015, 11 (01): : 29 - 36
  • [36] Simplified O(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
    Mansouri, H.
    Roos, C.
    OPTIMIZATION METHODS & SOFTWARE, 2007, 22 (03): : 519 - 530
  • [37] AN INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE LEAST-SQUARES PROBLEMS
    Daili, Chafia
    Achache, Mohamed
    APPLICATIONS OF MATHEMATICS, 2022, 67 (03) : 371 - 391
  • [38] INTERIOR-POINT METHODS IN SEMIDEFINITE PROGRAMMING WITH APPLICATIONS TO COMBINATORIAL OPTIMIZATION
    ALIZADEH, F
    SIAM JOURNAL ON OPTIMIZATION, 1995, 5 (01) : 13 - 51
  • [39] An interior-point algorithm for semidefinite least-squares problems
    Chafia Daili
    Mohamed Achache
    Applications of Mathematics, 2022, 67 : 371 - 391
  • [40] KERNEL FUNCTION BASED INTERIOR-POINT ALGORITHMS FOR SEMIDEFINITE OPTIMIZATION
    Lee, Yong-Hoon
    Jin, Jin-Hee
    Cho, Gyeong-Mi
    MATHEMATICAL INEQUALITIES & APPLICATIONS, 2013, 16 (04): : 1279 - 1294
12345