Erratum: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with (\sqrt{n}L)hBciteration complexity

We correct an error in Algorithm 2 from the paper with the same name that was published in Mathematical Programming, Ser. A, 100, 2(2004), 317–337. Citation submitted to Mathematical Programming Article Download View Erratum: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with (sqrt{n}L)hBciteration complexity

Corrector-predictor methods for sufficient linear complementarity problems in a wide neighborhood of the central path

Corrector-predictor methods for sufficient linear complementarity problems in a wide neighborhood of the central path Citation Technical Report UMBC, TR2006-22, January 2005, Revised: March 2006. Article Download View Corrector-predictor methods for sufficient linear complementarity problems in a wide neighborhood of the central path

Erratum: Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path,

We correct an error in Algorithms 4.1 and 4.8 from the paper with the same title that was published in Optimization Methods and Software, 20, 1 (2005), 145–168. Citation submitted to Optimization Methods and Software Article Download View Erratum: Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path,

Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path

Two corrector-predictor interior point algorithms are proposed for solving mono\-tone linear complementarity problems. The algorithms produce a sequence of iterates in the $\caln_{\infty}^{-}$ neighborhood 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 … Read more