Scholars Central

Review articlePublished 2011

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

Authors: B.O. Adejo, E. Ogala

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

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.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Advances in Applied Science Research.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalAdvances in Applied Science Research
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “B.O. Adejo”
  • BylineArticles whose byline prints “E. Ogala”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels