A primal-dual large-update interior-point algorithm for semi-definite optimization based on a new kernel function

  • Dequan Zhao College of Science, China Three Gorges University
  • Mingwang Zhang College of Science, China Three Gorges University

Abstract

Based on a new parametric kernel function, this paper presents a primal-dual large-update interior-point algorithm (IPM) for semi-definite optimization (SDO) problems. The new parametric function is neither self-regular function nor the usual logarithmic barrier function.  It is strongly convex and possesses some novel  analytic properties. We analyse this new parametric kernel function and show that the proposed algorithm has favorable complexity bound in terms of the analytic properties of the kernel function. Moreover, the complexity bound for our large-update IPM is shown to be O(\sqrt{n}(\log n)^2 \log\frac{n}{\epsilon}). Some numerical results are reported to illustrate the feasibility of the proposed algorithm.
Published
2013-12-01
How to Cite
Zhao, D., & Zhang, M. (2013). A primal-dual large-update interior-point algorithm for semi-definite optimization based on a new kernel function. Statistics, Optimization & Information Computing, 1(1), 41-61. https://doi.org/10.19139/soic.v1i1.8
Section
Research Articles