Polynomial interior-point algorithm for P horizontal linear complementarity problems

In this paper an interior-point algorithm for P * ( κ ) horizontal linear complementarity problems is proposed that uses new search directions. The theoretical complexity of the new algorithm is calculated. It is investigated that the proposed algorithm has quadratically convergent with polynomial i...

Full description

Saved in:
Bibliographic Details
Published inNumerical algorithms Vol. 63; no. 2; pp. 385 - 398
Main Authors Asadi, S., Mansouri, H.
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.06.2013
Springer Nature B.V
Subjects
Algebra
Algorithms
Complexity
Computer Science
Horizontal
Iterative methods
Mathematical analysis
Numeric Computing
Numerical Analysis
Original Paper
Polynomials
Searching
Theory of Computation
90C51
Feasible interior-point method
Horizontal linear complementarity problem
90C33
Central path
Online AccessGet full text
ISSN1017-1398
1572-9265
DOI10.1007/s11075-012-9628-0

Cover

More Information
Summary:In this paper an interior-point algorithm for P * ( κ ) horizontal linear complementarity problems is proposed that uses new search directions. The theoretical complexity of the new algorithm is calculated. It is investigated that the proposed algorithm has quadratically convergent with polynomial iteration complexity , coincide with the best known iteration bound for P * ( κ ) horizontal linear complementarity problems.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1017-1398
1572-9265
DOI:10.1007/s11075-012-9628-0