Abstract
In this paper, we present a new primal-dual interior-point algorithm for solving a special case of convex quadratic semi-definite optimization based on a parametric kernel function. The proposed parametric kernel function is used both for determining the search directions and for measuring the distance between the given iterate and the μ -center for the algorithm. These properties enable us to derive the currently best known iteration bounds for the algorithm with large- and small-update methods, namely, O ( n log n log n ε ) and O ( n log n ε ) , respectively, which reduce the gap between the practical behavior of the algorithm and its theoretical performance results.
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.
