Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

MP

2008

2008

Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the Nneighborhood of the central path. The first algorithm uses line search schemes requiring the solution of higher order polynomial equations in one variable, while the line search procedures of the second algorithm can be implemented in O(m n1+) arithmetic operations, where n is the dimension of the problems, (0, 1] is a constant, and m is the maximum order of the predictor and the corrector. If m = (log n) then both algorithms have O( nL) iteration complexity. They are superlinearly convergent even for degenerate problems. Key words. linear complementarity problem, interior-point algorithm, large neighbourhood, superlinear convergence

Added |
13 Dec 2010 |

Updated |
13 Dec 2010 |

Type |
Journal |

Year |
2008 |

Where |
MP |

Authors |
Florian A. Potra |

Comments (0)