Abstract
In this paper, we deal with a polynomial primal-dual interior-point algorithm for solving convex quadratic programming based on a new parametric kernel function with an exponential barrier term. The proposed kernel function is not logarithmic and not self-regular. We analyze a class of large and small-update versions which are based on our new kernel function. The complexity obtained generalizes the result given by Bai et al. This result is the first to reach this goal. Finally, some numerical results are provided to show the efficiency of the proposed algorithm and to compare it with an available method.
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.
