A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions

被引：16

作者：

Peyghami, M. Reza ^{[1
,2
]}

Fathi-Hafshejani, S. ^{[3
]}

Chen, S. ^{[4
]}

机构：

[1] KN Toosi Univ Tech, Fac Math, POB 16315-1618, Tehran, Iran

[2] KN Toosi Univ Tech, Sci Computat Optimizat & Syst Engn SCOPE, Tehran, Iran

[3] Shiraz Univ Tech, Fac Math, POB 71555-313, Shiraz, Iran

[4] York Univ, Dept Math & Stat, Toronto, ON M3J 2R7, Canada

来源：

OPERATIONS RESEARCH LETTERS | 2016年 / 44卷 / 03期

关键词：

Proximity function; Semidefinite optimization; Interior-point methods; Large-update methods; KERNEL FUNCTION; ALGORITHM; COMPLEXITY;

D O I：

10.1016/j.orl.2016.02.013

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

A primal-dual interior-point method (IPM) based on a new class of proximity functions is proposed for solving Semidefinite Optimization (SDO) problems. The proposed functions are induced from the kernel functions with trigonometric barrier terms. We derive iteration complexity of large-update IPMs for SDO as O(root n log n log n/epsilon). This improves the result obtained in Li and Zhang (2015) for linear optimization and matches to the bound for the so-called self-regular kernel functions. (C) 2016 Elsevier B.V. All rights reserved.

引用

页码：319 / 323

页数：5

共 50 条

[41] A primal-dual large-update interior-point algorithm for P*(κ)-LCP based on a new class of kernel functions
Ping Ji
Ming-wang Zhang
Xin Li
Acta Mathematicae Applicatae Sinica, English Series, 2018, 34 : 119 - 134
[42] Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
Xinzhong Cai
Guoqiang Wang
Zihou Zhang
Numerical Algorithms, 2013, 62 : 289 - 306
[43] Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
Cai, Xinzhong
Wang, Guoqiang
Zhang, Zihou
NUMERICAL ALGORITHMS, 2013, 62 (02) : 289 - 306
[44] PRIMAL-DUAL INTERIOR POINT MULTIGRID METHOD FOR TOPOLOGY OPTIMIZATION
Kocvara, Michal
Mohammed, Sudaba
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2016, 38 (05) : B685 - B709
[45] Convergence rate of primal-dual reciprocal barrier Newton interior-point methods
El-Bakry, AS
OPTIMIZATION METHODS & SOFTWARE, 1998, 9 (1-3) : 37 - 44
[46] A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
Bai, Y. Q.
Lesaja, G.
Roos, C.
Wang, G. Q.
El Ghami, M.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2008, 138 (03) : 341 - 359
[47] A primal-dual interior-point method based on a new kernel function for linear complementarity problem
Djeffal, El Amir
Laouar, Mounia
ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2019, 12 (07)
[48] 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
[49] A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds
Kheirfam B.
Afrika Matematika, 2017, 28 (3-4) : 389 - 406
[50] PRIMAL-DUAL INTERIOR-POINT ALGORITHM FOR LO BASED ON A NEW KERNEL FUNCTION
Li, Xin
Zhang, Mingwang
Ji, Ping
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2016, (36): : 319 - 334

← 1 2 3 4 5 →