700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ ReadersThis Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)
Review Article Open Access
In this article, we compare three previous termination rules for primal-dual short step pathfollowing algorithm for semi-definite programming proposed earlier by Monteiro, Adejo and Adejo and Singh independently, which were based on analyses carried out independently by Franklin and Singh et al for Karmarkar’s algorithm for linear programming, Here, we develop a more efficient termination rule which on implementation saves at least 95% iterations over that of Monteiro and at least 8% iterations over that of Adejo and Singh.
To read the full article Peer-reviewed Article PDF
Author(s): BO Adejo and E Ogala
Semi-definite, upper ceiling function, primal-dualmethods, path-following methods, NP-hard problems., primal-dual methods