@article {8713,
	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},
	year = {2016},
	pages = {35-58},
	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\&nbsp;O(6(m+1)3m+42(m+1)Ψm+22(m+1)01θlognμ0ε)O(6(m+1)3m+42(m+1)Ψ0m+22(m+1)1θlog⁡nμ0ε), where\&nbsp;m\&gt;4m\&gt;4.},
	url = {https://jmm.guilan.ac.ir/?_action=article\&au=10070\&_au=El+Amir++Djeffal},
	author = {El Amir Djeffal and Lakhdar Djeffal}
}
