On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function

被引：14

作者：

Choi, Bo Kyung ^{[1
]}

Lee, Gue Myung ^{[1
]}

机构：

[1] Pukyong Natl Univ, Div Math Sci, Pusan 608737, South Korea

来源：

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS | 2009年 / 71卷 / 12期

关键词：

Semidefinite optimization problem; Primal-dual interior-point methods; Kernel function; Proximity function; Complexity analysis; Worst-case iteration bound; ALGORITHMS;

D O I：

10.1016/j.na.2009.05.078

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The purpose of this paper is to obtain new complexity results for a semidefinite optimization (SDO) problem. We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a large-update primal-dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we show that the worst-case iteration bound for our IPM is O(root n(log n)(q+1/q) log n/c), where q >= 1 (C) 2009 Elsevier Ltd. All rights reserved.

引用

页码：E2628 / E2640

页数：13

共 50 条

[21] A large-update primal-dual interior-point algorithm for second-order cone optimization based on a new proximity function [J].

Fathi-Hafshejani, S. ;

Mansouri, H. ;

Peyghami, M. Reza .

OPTIMIZATION, 2016, 65 (07) :1477-1496

[22] Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function [J].

Peyghami, M. Reza ;

Hafshejani, S. Fathi .

NUMERICAL ALGORITHMS, 2014, 67 (01) :33-48

[23] PRIMAL-DUAL INTERIOR POINT METHOD BASED ON A NEW BARRIER FUNCTION [J].

Cho, Gyeong-Mi .

JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2011, 12 (03) :611-624

[24] Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function [J].

M. Reza Peyghami ;

S. Fathi Hafshejani .

Numerical Algorithms, 2014, 67 :33-48

[25] PRIMAL-DUAL INTERIOR-POINT ALGORITHM FOR LO BASED ON A NEW KERNEL FUNCTION [J].

Li, Xin ;

Zhang, Mingwang ;

Ji, Ping .

ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2016, (36) :319-334

[26] Complexity Analysis of Primal-Dual Interior-Point Methods for Linear Optimization Based on a New Parametric Kernel Function with a Trigonometric Barrier Term [J].

Cai, X. Z. ;

Wang, G. Q. ;

El Ghami, M. ;

Yue, Y. J. .

ABSTRACT AND APPLIED ANALYSIS, 2014,

[27] Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier [J].

Cai, Xinzhong ;

Wang, Guoqiang ;

Zhang, Zihou .

NUMERICAL ALGORITHMS, 2013, 62 (02) :289-306

[28] A feasible primal-dual interior point method for linear semidefinite programming [J].

Touil, Imene ;

Benterki, Djamel ;

Yassine, Adnan .

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2017, 312 :216-230

[29] Primal-dual interior-point methods for PDE-constrained optimization [J].

Ulbrich, Michael ;

Ulbrich, Stefan .

MATHEMATICAL PROGRAMMING, 2009, 117 (1-2) :435-485

[30] Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function [J].

Bouhenache, Youssra ;

Chikouche, Wided ;

Touil, Imene ;

Fathi-Hafshejani, Sajad .

JOURNAL OF MATHEMATICAL MODELING, 2024, 12 (02) :247-265

← 1 2 3 4 5 →