A New Full-Newton Step $O(n)$ Infeasible Interior-Point Algorithm for $P_*(\kappa)$-horizontal Linear Complementarity Problems
In this paper, we first present a brief review about the feasible interior-point algorithm for $P_*(\kappa)$-horizontal linear complementarity problems (HLCPs) based on new directions. Then we present a new infeasible interior-point algorithm for these problems. The algorithm uses two types of fu...
Main Authors: | Soodabeh Asadi, Hossein Mansouri |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2014-03-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/files/csjm/v22-n1/v22-n1-(pp37-61).pdf |
Similar Items
-
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 full-modified-Newton step infeasible interior-point method for monotone linear complementarity problem
by: Nezameddin Mahdavi-Amiri, et al.
Published: (2021-05-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 new search direction for full-Newton step infeasible interior-point method in linear optimization
by: Behrouz Kheirfam
Published: (2023-01-01) -
An infeasible interior point methods for convex quadratic problems
by: Hayet Roumili, et al.
Published: (2018-12-01)