A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems

2020 ◽  
Vol 186 (3) ◽  
pp. 864-878
Author(s):  
Soodabeh Asadi ◽  
Zsolt Darvay ◽  
Goran Lesaja ◽  
Nezam Mahdavi-Amiri ◽  
Florian Potra
Keyword(s):  
Interior Point ◽  
Interior Point Method ◽  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Point Method ◽  
Newton Step ◽  
Full Newton Step

An infeasible interior-point method with improved centering steps for monotone linear complementarity problems

2015 ◽  
Vol 08 (03) ◽  
pp. 1550037 ◽  
Author(s):  
Soodabeh Asadi ◽  
Hossein Mansouri ◽  
Zsolt Darvay
Keyword(s):  
Interior Point ◽  
Interior Point Method ◽  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Interior Point Algorithm ◽  
Newton Step ◽  
Nonlinear Anal ◽  
Infeasible Interior Point Method ◽  
Full Newton Step

In this paper, we improve the infeasible full-Newton interior-point algorithm presented by Mansouri et al. [A full-Newton step [Formula: see text] infeasible interior-point algorithm for linear complementarity problems, Nonlinear Anal. Real World Appl. 12 (2011) 545–561] for monotone linear complementarity problems (MLCPs). In each iteration of Mansouri’s algorithm two types of full-Newton steps are used, one feasibility step and some ordinary (centering) steps. In this paper, we use a new search direction, and reduce the number of the centering steps, so that only one centering step is needed. We prove that the complexity of the algorithm is as good as the best-known complexity for infeasible interior-point methods for MLCPs.

Path-following interior-point algorithm for monotone linear complementarity problems

2021 ◽  
Author(s):  
Welid Grimes
Keyword(s):  
Interior Point ◽  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Path Following ◽  
Linear Complementarity ◽  
Interior Point Algorithm ◽  
Newton Step ◽  
Barrier Parameter ◽  
Step Algorithm ◽  
Full Newton Step

This paper presents a path-following full-Newton step interior-point algorithm for solving monotone linear complementarity problems. Under new choices of the defaults of the updating barrier parameter [Formula: see text] and the threshold [Formula: see text] which defines the size of the neighborhood of the central-path, we show that the short-step algorithm has the best-known polynomial complexity, namely, [Formula: see text]. Finally, some numerical results are reported to show the efficiency of our algorithm.

Sign in / Sign up

Export Citation Format

Share Document