Abstract
In this paper, we present a class of polynomial-time primal–dual interior-point methods (IPMs) for semi-definite optimization based on a new class of kernel functions. This class is fairly general and includes the class of finite kernel functions [Y.Q. Bai, M. El Ghami and C. Roos, A new efficient large-update primal–dual interior-point method based on a finite barrier, SIAM J. Optim. 13(3) (2003), pp. 766–782]: the corresponding barrier functions have a finite value at the boundary of the feasible region. They are not exponentially convex and also not strongly convex like many usual barrier functions. We show that the IPMs based on these functions have favourable complexity results. To achieve this, several new tools are derived in the analysis. The kernel functions depend on parameters p∈[0, 1] and σ≥1. When those parameters are appropriately chosen, then the iteration bound of large-update IPMs based on these functions, coincide with the currently best known bounds for primal–dual IPMs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
