AU - Peyghami, M. R. AU - Fathi Hafshejani, S. TI - An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function PT - JOURNAL ARTICLE TA - IJMSI JN - IJMSI VO - 12 VI - 1 IP - 1 4099 - http://ijmsi.ir/article-1-671-en.html 4100 - http://ijmsi.ir/article-1-671-en.pdf SO - IJMSI 1 ABĀ  - In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) function nor logarithmic barrier function, the primal-dual IPMs based on this kernel function enjoy the worst case iteration bound $Oleft(sqrt{n}log nlog frac{n}{epsilon}right)$ for the large-update methods with the special choice of its parameters. This bound coincides to the so far best known complexity results obtained from SR kernel functions for linear and semidefinite optimization problems. Finally some numerical issues regarding the practical performance of the new proposed kernel function is reported. CP - IRAN IN - Faculty of Matematics LG - eng PB - IJMSI PG - 131 PT - Research paper YR - 2017