Optimization Online


An Infeasible Interior-Point Algorithm with full-Newton Step for Linear Optimization

H. Mansouri (H.Mansouri***at***tudelft.nl)
M. Zangiabadi (M.Zangiabadi***at***tudelft.nl)
Y. Bai (yqbai***at***staff.shu.edu.cn)
C. Roos (C.Roos***at***tudelft.nl)

Abstract: In this paper we present an infeasible interior-point algorithm for solving linear optimization problems. This algorithm is obtained by modifying the search direction in the algorithm [C. Roos, A full-Newton step ${O}(n)$ infeasible interior-point algorithm for linear optimization, 16(4) 2006, 1110-1136.]. The analysis of our algorithm is much simpler than that of the Roos's algorithm at some places. The iteration bound of the algorithm is as good as the best known iteration bound $O(n\log \frac{1}{\varepsilon})$ for IIPMs.

Keywords: Linear optimization, infeasible interior-point method, primal-dual method, polynomial complexity.

Category 1: Linear, Cone and Semidefinite Programming

Category 2: Linear, Cone and Semidefinite Programming (Linear Programming )

Citation: Manuscript. Delft University of Technology. P.O. Box 5031, 2600 GA Delft, The Netherlands. May 2007.

Download: [Postscript][PDF]

Entry Submitted: 07/30/2008
Entry Accepted: 07/30/2008
Entry Last Modified: 08/01/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society