  


An Infeasible InteriorPoint Algorithm with fullNewton Step for Linear Optimization
H. Mansouri (H.Mansouritudelft.nl) Abstract: In this paper we present an infeasible interiorpoint algorithm for solving linear optimization problems. This algorithm is obtained by modifying the search direction in the algorithm [C. Roos, A fullNewton step ${O}(n)$ infeasible interiorpoint algorithm for linear optimization, 16(4) 2006, 11101136.]. 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 interiorpoint method, primaldual 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 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  