Please use this identifier to cite or link to this item: http://hdl.handle.net/10348/6852
Title: On the convergence of a predictor-corrector variant algorithm
Authors: Almeida, Regina
Teixeira, Ana Paula
Keywords: Linear Programming
Predictor-corrector algorithm
Interior-point methods
Mehrotra-type algorithm
Polynomial complexity
Superlinear convergence
Issue Date: Jul-2015
Publisher: Springer Berlin Heidelberg
Abstract: A feasible predictor-corrector Linear Programming variant of Mehrotra’s algorithm, that was shown to have good performance on transportation and assignment problems, was developed by Bastos and Paixao. We prove the theoretical efficiency of this algorithm by showing its polynomial complexity and its superlinear convergence.
Peer Reviewed: yes
URI: http://hdl.handle.net/10348/6852
ISSN: Almeida, R.; Teixeira, A.. 2015. On the convergence of a predictor-corrector variant algorithm, TOP 23, 2: 401 - 418.
Print 1134-5764
Online 1863-8279
metadata.dc.relation.publisherversion: http://link.springer.com/article/10.1007%2Fs11750-014-0346-8
Document Type: Article
Appears in Collections:DMAT - Artigo publicado em Revista Científica Indexada

Files in This Item:
File Description SizeFormat 
On the convergence of a predictor-corrector variant algorithm.pdf
  Restricted Access
28,47 kBAdobe PDFView/Open Request a copy


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex mendeley Endnote Logotipo do DeGóis Logotipo do Orcid 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.