Theoretical and numerical result for linear semidefinite programming based on a new kernel function

Abstract

Kernel functions serve the central goal of creating new search directions for the primal-dual interiorpoint algorithm to solve linear optimization problems. A significantly improved primal-dual interior-point algorithm for linear optimization is presented based on a novel kernel function. We show a primal-dual interior-point technique for linear optimization based on a class of kernel functions that are eligible. This research presents a new efficient kernel function-based primal-dual IPM algorithm for semidefinite programming problems based on the Nesterov-Todd (NT) direction. With a new and simple technique, we propose a new kernel function to obtain an optimal solution of the perturbed problem (SDP)µ. We obtain the best-known complexity results,for smalland large-update namely O(p^p+1/2p √nlog tr(X⁰S⁰)/ε) and O((pn)^p+1/2p log trX⁰S⁰/ε) large update To prove the effectiveness of our proposed kernel function, we compare our numerical results with some alternatives presented by Touil et al. (2017).