An interior point method for monotone linear complementarity problems acting in a wide neighborhood of the central path is presented. The method has O( √ nL)iteration complexity and is superlinearly convergent even when the problem does not possess a strictly complementary solution.

In a recent paper, Noor and Noor [K. Inayat Noor, M. Aslam Noor, Predictor–corrector Halley method for nonlinear equations, Appl. Math. Comput., in press, doi:10.1016/j.amc.11.023] have suggested and analyzed a predictor–corrector method Halley method for solving nonlinear equations. In this paper, we modified this method by using the finite difference scheme, which has a quintic convergence. W...

This paper considers the development of a two-point predictor-corrector block method for solving delay differential equations. The formulae are represented in divided difference form and the algorithm is implemented in variable stepsize variable order technique. The block method produces two new values at a single integration step. Numerical results are compared with existing methods and it is ...

In this paper, a new predictor-corrector method is proposed for solving sufficient linear complementarity problems (LCP) with an infeasible starting point. The method generates a sequence of iterates in a wide and symmetric neighborhood of the infeasible central path of the LCP. If the starting point is feasible or close to being feasible, then an ε-approximate solution is obtained in at most O...

Diagonal updating scheme is among the cheapest Newton-like methods for solving system of nonlinear equations. Nevertheless, the method has some shortcomings. In this paper, we proposed an improved matrix-free secant updating scheme via line search strategies, by using the steps of backtracking in the Armijo-type line search as a step length predictor and Wolfe-Like condition as corrector. Our a...

Several approaches exist for modeling recovery of faulttolerant systems during the requirements analysis phase. Most of these approaches are inclined by design techniques for recovery. Such designbiased analysis methods unnecessarily constrain an analyst when specifying recovery requirements. To remedy such restrictions, we present an object analysis pattern, called the corrector pattern, that ...

Interior point methods have been widely used to determine the solution of large-scale linear programming problems. The predictor-corrector method stands out among all variations of interior point methods due to its efficiency and fast convergence. In each iteration it is necessary to solve two linear systems to determine the predictor-corrector direction. Solving such systems corresponds to the...

A predictor-corrector method for solving linear programs from infeasible starting points is analyzed. The method is quadratically convergent and can be combined with Ye's finite termination scheme under very general assumptions. If the starting points are large enough then the algorithm has O(nL) iteration complexity. If the ratio between feasibility and optimality at the starting points is sma...