Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
We present an Infeasible Interior-Point Method for monotone Linear Complementarity Problem (LCP) which is an improved version of the algorithm given in [13]. In the earlier version, each iteration consisted of one feasibility step and few centering steps. The improved version guarantees that after o...
Main Authors: | Goran Lešaja, Mustafa Ozen |
---|---|
Format: | Article |
Language: | English |
Published: |
Croatian Operational Research Society
2016-04-01
|
Series: | Croatian Operational Research Review |
Subjects: | |
Online Access: | http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=231888 |
Similar Items
-
INFEASIBLE FULL NEWTON-STEP INTERIOR-POINT METHOD FOR LINEAR COMPLEMENTARITY PROBLEMS
by: Goran Lešaja, et al.
Published: (2012-12-01) -
An infeasible interior-point method for the $P_*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
by: B. Kheirfam, et al.
Published: (2018-01-01) -
A full-modified-Newton step infeasible interior-point method for monotone linear complementarity problem
by: Nezameddin Mahdavi-Amiri, et al.
Published: (2021-05-01) -
A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
by: Asadi S., et al.
Published: (2015-01-01) -
A New Full-Newton Step $O(n)$ Infeasible Interior-Point Algorithm for $P_*(\kappa)$-horizontal Linear Complementarity Problems
by: Soodabeh Asadi, et al.
Published: (2014-03-01)