A PRIMAL-DUAL INTERIOR-POINT METHOD FOR THE SEMIDEFINITE PROGRAMMING PROBLEM BASED ON A NEW KERNEL FUNCTION

被引:2
|
作者
Touil, Imene [1 ]
Benterki, Djamel [2 ]
机构
[1] Mohammed Sedd Ben Yahia Univ, Dept Math, LMAM, Jijel, Algeria
[2] Ferhat Abbas Univ, Dept Math, LMEN, Setif, Algeria
来源
关键词
Linear semidefinite programming; Primal-dual interior point methods; Kernel function; Complexity analysis; Worst-case iteration bound; COMPLEXITY ANALYSIS; ALGORITHM;
D O I
10.23952/jnfa.2019.25
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The purpose of this paper is to improve the complexity of a large-update primal-dual interior point method for a semidefinite programming problem. We define a proximity function for the semidefinite programming problem based on a new parametric kernel function and prove that the worst-case iteration bound for the new correspondent algorithm is O (root n (lnn)(pq+1/pq) ln n/epsilon), where p,q >= 1.
引用
收藏
页数:17
相关论文
共 50 条
  • [1] A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
    Mengmeng Li
    Mingwang Zhang
    Kun Huang
    Zhengwei Huang
    [J]. Optimization and Engineering, 2021, 22 : 293 - 319
  • [2] A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
    Li, Mengmeng
    Zhang, Mingwang
    Huang, Kun
    Huang, Zhengwei
    [J]. OPTIMIZATION AND ENGINEERING, 2021, 22 (01) : 293 - 319
  • [3] A primal-dual regularized interior-point method for semidefinite programming
    Dehghani, A.
    Goffin, J. -L.
    Orban, D.
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2017, 32 (01): : 193 - 219
  • [4] A primal-dual interior-point method based on a new kernel function for linear complementarity problem
    Djeffal, El Amir
    Laouar, Mounia
    [J]. ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2019, 12 (07)
  • [5] A Primal-Dual Interior-Point Filter Method for Nonlinear Semidefinite Programming
    Liu, Zhong-Yi
    Sun, Wen-Yu
    [J]. OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2008, 8 : 112 - +
  • [6] A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
    Cho, G. M.
    Cho, Y. Y.
    Lee, Y. H.
    [J]. ANZIAM JOURNAL, 2010, 51 (04): : 476 - 491
  • [7] A primal-dual interior-point algorithm for convex quadratic semidefinite optimization based on a new kernel function
    Pang, Jinjuan
    Zhang, Mingwang
    Chen, Yuejiao
    Huang, Zhengwei
    [J]. INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2015, 53 (06): : 22 - 37
  • [8] On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
    Choi, Bo Kyung
    Lee, Gue Myung
    [J]. NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2009, 71 (12) : E2628 - E2640
  • [9] SEMIDEFINITE PROGRAMMING: FORMULATIONS AND PRIMAL-DUAL INTERIOR-POINT METHODS
    Fukuda, Mituhiro
    Nakata, Maho
    Yamashita, Makoto
    [J]. REDUCED-DENSITY-MATRIX MECHANICS - WITH APPLICATION TO MANY-ELECTRON ATOMS AND MOLECULES, 2007, 134 : 103 - 118
  • [10] A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions
    El Ghami, Mohamed
    Roos, Cornelis
    Steihaug, Trond
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2010, 25 (03): : 387 - 403