In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...

In the last lecture, we were introduced to the Interior Point Method. The simplex method solves linear programming problems (LP) by visiting extreme points (vertices) on the boundary of the feasible set. In contrast, the interior point method is based on algorithms that find an optimal solution while moving in the interior of the feasible set. Intuitively, in each iteration of the interior poin...

Exploring Complexity of Large Update Interior-Point Methods for ) k ( P* Linear Complementarity Problems Based on Kernel Function KEYVAN AMINI* M.REZA PEYGHAMI +,2 ∗ Department of Sciences, Razi University, Kermanshah, Iran + Department of Sciences, Khajeh Nasir Toosi (KNT) University of Technology, Tehran, Iran Abstract. Interior Point Methods not only are the most effective methods in practic...

An interior point of a finite planar point set is a point of the set that is not on the boundary of the convex hull of the set. For any integer k ≥ 1, let g(k) be the smallest integer such that every planar point set in general position with at least g(k) interior points has a convex subset of points with exactly k interior points of P . In this article, we prove that g(3)= 9.