INFEASIBLE FULL NEWTON-STEP INTERIOR-POINT METHOD FOR LINEAR COMPLEMENTARITY PROBLEMS
In this paper we consider an Infeasible Full Newton-step Interior-Point Method (IFNS-IPM) for monotone Linear Complementarity Problems (LCP). The method does not require a strictly feasible starting point. In addition, the method avoids calculation of the step size and instead takes full Newton-step...
Main Authors: | Goran Lešaja, Antre M. Drummer, Ljiljana Miletić |
---|---|
Format: | Article |
Language: | English |
Published: |
Croatian Operational Research Society
2012-12-01
|
Series: | Croatian Operational Research Review |
Subjects: | |
Online Access: | http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=142455 |
Similar Items
-
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
by: Goran Lešaja, et al.
Published: (2016-04-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-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) -
New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization
by: Kheirfam Behrouz
Published: (2018-01-01)