@article {
author = {Djeffal, El Amir and Djeffal, Lakhdar},
title = {A path following interior-point algorithm for semidefinite optimization problem based on new kernel function},
journal = {Journal of Mathematical Modeling},
volume = {4},
number = {1},
pages = {35-58},
year = {2016},
publisher = {University of Guilan},
issn = {2345-394X},
eissn = {2382-9869},
doi = {},
abstract = {In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a 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(6(m+1)^{\frac{3m+4}{2(m+1)}}\Psi _{0}^{\frac{m+2}{2(m+1)}}\frac{1}{\theta }\log \frac{n\mu ^{0}}{\varepsilon })$, where $m>4$.},
keywords = {quadratic programming,convex nonlinear programming,interior point methods},
url = {https://jmm.guilan.ac.ir/article_1805.html},
eprint = {https://jmm.guilan.ac.ir/article_1805_783e5a298d09d5f817ee51668fdce93b.pdf}
}