Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals |
| |
Authors: | G Zhao J Stoer |
| |
Institution: | (1) Institut für Angewandte Mathematik und Statistik, Universität Würzburg, Am Hubland, W-8700 Würzburg, Germany |
| |
Abstract: | In this paper we study a particular class of primal-dual path-following methods which try to follow a trajectory of interior feasible solutions in primal-dual space toward an optimal solution to the primal and dual problem. The methods investigated are so-called first-order methods: each iteration consists of a long step along the tangent of the trajectory, followed by explicit recentering steps to get close to the trajectory again. It is shown that the complexity of these methods, which can be measured by the number of points close to the trajectory which have to be computed in order to achieve a desired gain in accuracy, is bounded by an integral along the trajectory. The integrand is a suitably weighted measure of the second derivative of the trajectory with respect to a distinguished path parameter, so the integral may be loosely called a curvature integral. |
| |
Keywords: | Complexity Estimates by integrals Analytic centers Path-following method Interior-point method Linear programs |
本文献已被 SpringerLink 等数据库收录! |
|