Convergence Analysis of Inexact Infeasible Interior Point Method for Linear Optimization
Abstract: In this paper we present the convergence analysis of the inexact infeasible path-following(IIPF) interior point algorithm. In this algorithm the preconditioned conjugate gradient method is used to solve the reduced KKT system (the augmented system). The augmented system is preconditioned by using a block triangular matrix. The KKT system is solved approximately. Therefore, it becomes necessary to study the convergence of interior point method for this specific inexact case. We present the convergence analysis of the inexact infeasible path-following (IIPF) algorithm, prove the global convergence of this method and provide complexity analysis.
Keywords: Inexact Interior Point Methods, Linear Programming, Preconditioned Conjugate Gradients, Indefinite System.
Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )
Citation: MS-2007-03, School of Mathematics, University of Edinburgh, JCMB, King's Buildings, EDINBURGH, EH9 3JZ, UK. 08/2007
Entry Submitted: 09/03/2007
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|