A Wide-Neighborhood Predictor-Corrector Interior-Point Algorithm for Linear Complementarity Problems

In this paper, a wide-neighborhood predictor-corrector feasible interior-point algorithm for linear complementarity problems is proposed. The algorithm is based on using the classical affine scaling direction as a part in a corrector step, not in a predictor step. The convergence analysis of the alg...

Full description

Saved in:
Bibliographic Details
Published in:Journal of the Operations Research Society of China (Internet) 2018-12, Vol.6 (4), p.529-543
Main Authors: Pirhaji, Mohammad, Mansouri, Hossein, Zangiabadi, Maryam
Format: Article
Language:English
Subjects:
Algorithms
Iterative methods
Mathematical problems
Mathematical programming
Neighborhoods
Optimization
Polynomials
Predictor-corrector methods
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a wide-neighborhood predictor-corrector feasible interior-point algorithm for linear complementarity problems is proposed. The algorithm is based on using the classical affine scaling direction as a part in a corrector step, not in a predictor step. The convergence analysis of the algorithm is shown, and it is proved that the algorithm has the polynomial complexity Onlogε-1 which coincides with the best known iteration bound for this class of mathematical problems. The numerical results indicate the efficiency of the algorithm.
ISSN:2194-668X
2194-6698
DOI:10.1007/s40305-017-0178-y