Local convergence of primal-dual interior point methods for nonlinear semidefinite optimization using the Monteiro-Tsuchiya family of search directions

被引:0
|
作者
Okuno, Takayuki [1 ,2 ]
机构
[1] Seikei Univ, Fac Sci & Technol, Dept Sci & Technol, Tokyo, Japan
[2] RIKEN, Ctr Adv Intelligence Project, Tokyo, Japan
基金
日本学术振兴会;
关键词
Nonlinear semidefinite optimization problem; Primal-dual interior point method; Monteiro-Tsuchiya family of directions; Local convergence; AUGMENTED LAGRANGIAN FUNCTIONS; POLYNOMIAL CONVERGENCE; ALGORITHMS; SDP; STABILITY;
D O I
10.1007/s10589-024-00562-y
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The recent advance of algorithms for nonlinear semidefinite optimization problems (NSDPs) is remarkable. Yamashita et al. first proposed a primal-dual interior point method (PDIPM) for solving NSDPs using the family of Monteiro-Zhang (MZ) search directions. Since then, various kinds of PDIPMs have been proposed for NSDPs, but, as far as we know, all of them are based on the MZ family. In this paper, we present a PDIPM equipped with the family of Monteiro-Tsuchiya (MT) directions, which were originally devised for solving linear semidefinite optimization problems as were the MZ family. We further prove local superlinear convergence to a Karush-Kuhn-Tucker point of the NSDP in the presence of certain general assumptions on scaling matrices, which are used in producing the MT search directions. Finally, we conduct numerical experiments to compare the efficiency among members of the MT family.
引用
收藏
页码:677 / 718
页数:42
相关论文
共 50 条
  • [21] Structured Primal-dual Interior-point Methods for Banded Semidefinite Programming
    Deng, Zhiming
    Gu, Ming
    Overton, Michael L.
    TOPICS IN OPERATOR THEORY: OPERATORS, MATRICES AND ANALYTIC FUNCTIONS, VOL 1, 2010, 202 : 111 - +
  • [22] An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
    Zaoui, Billel
    Benterki, Djamel
    Yassine, Adnan
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2024, 70 (03) : 2129 - 2148
  • [23] Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
    Fujisawa, K
    Kojima, M
    Nakata, K
    MATHEMATICAL PROGRAMMING, 1997, 79 (1-3) : 235 - 253
  • [24] Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
    Gould, NIM
    Orban, D
    Sartenaer, A
    Toint, PL
    SIAM JOURNAL ON OPTIMIZATION, 2001, 11 (04) : 974 - 1002
  • [25] On the convergence of primal-dual interior-point methods with wide neighborhoods
    Tuncel, Levent, 1600, Kluwer Academic Publishers, Dordrecht, Netherlands (04):
  • [26] ON THE CONVERGENCE OF THE ITERATION SEQUENCE IN PRIMAL-DUAL INTERIOR-POINT METHODS
    TAPIA, RA
    ZHANG, Y
    YE, YY
    MATHEMATICAL PROGRAMMING, 1995, 68 (02) : 141 - 154
  • [27] A primal-dual interior-point algorithm with arc-search for semidefinite programming
    Zhang, Mingwang
    Yuan, Beibei
    Zhou, Yiyuan
    Luo, Xiaoyu
    Huang, Zhengwei
    OPTIMIZATION LETTERS, 2019, 13 (05) : 1157 - 1175
  • [28] A primal-dual interior-point algorithm with arc-search for semidefinite programming
    Mingwang Zhang
    Beibei Yuan
    Yiyuan Zhou
    Xiaoyu Luo
    Zhengwei Huang
    Optimization Letters, 2019, 13 : 1157 - 1175
  • [29] A local convergence property of primal-dual methods for nonlinear programming
    Paul Armand
    Joël Benoist
    Mathematical Programming, 2008, 115 : 199 - 222
  • [30] A local convergence property of primal-dual methods for nonlinear programming
    Armand, Paul
    Benoist, Joel
    MATHEMATICAL PROGRAMMING, 2008, 115 (02) : 199 - 222