alexa Abstract | On Optimal Termination Rule for Primal-Dual Algorithm for Semi-Definite Programming

Advances in Applied Science Research
Open Access

OMICS International organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations

700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Review Article Open Access

Abstract

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 image

Author(s): BO Adejo and E Ogala

Keywords

Semi-definite, upper ceiling function, primal-dualmethods, path-following methods, NP-hard problems., primal-dual methods

 
Peer Reviewed Journals
 
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
 
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

 
© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version
adwords