Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4636489 | Applied Mathematics and Computation | 2007 | 6 Pages |
Abstract
In this paper extended algorithm of Karmarkar’s interior point algorithm is considered. Theoretical aspects of the new algorithm are discussed. We show that the new iterative algorithm converges faster than former Karmarkar’s algorithms. Successful convergence for problems of different sizes is obtained. Numerical results show that when we use a new parameter in the classical Karmarkar’s algorithm, number of iterations is less than the number of iterations for two mentioned methods.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Rasool Naseri, Azizollah Valinejad,