|
Abstract
|
Kernel functions play an important role in defining new search directions for
primal-dual interior-point algorithms for solving symmetric optimization problems. In this
paperwe present a newkernel function for which interior point method yields iteration bounds
O(√r log r log r
) and O(√r log r
) for large-and small-update methods, respectively, which
matches currently the best known bounds for such methods.
|