On the convergence of a predictor-corrector variant algorithm

Data
2015-07
Autores
Almeida, Regina
Teixeira, Ana Paula
Título da revista
ISSN da revista
Título do Volume
Editora
Springer Berlin Heidelberg
Projetos de investigação
Unidades organizacionais
Fascículo
Resumo
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.
Descrição
Palavras-chave
Linear Programming , Predictor-corrector algorithm , Interior-point methods , Mehrotra-type algorithm , Polynomial complexity , Superlinear convergence
Citação