Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence
Chee-Khian Sim ()
Additional contact information
Chee-Khian Sim: University of Portsmouth
Computational Optimization and Applications, 2019, vol. 74, issue 2, No 8, 583-621
Abstract:
Abstract We consider in this paper an infeasible predictor–corrector primal–dual path following interior point algorithm using the Nesterov–Todd search direction to solve semi-definite linear complementarity problems. Global convergence and polynomial iteration complexity of the algorithm are established. Two sufficient conditions are also given for superlinear convergence of iterates generated by the algorithm. Preliminary numerical results are finally provided when the algorithm is used to solve semi-definite linear complementarity problems.
Keywords: Nesterov–Todd (NT) direction; Predictor–corrector primal–dual path following interior point algorithm; Semi-definite linear complementarity problem; Polynomial complexity; Local convergence (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10589-019-00110-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:74:y:2019:i:2:d:10.1007_s10589-019-00110-z
Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589
DOI: 10.1007/s10589-019-00110-z
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().