A full-Newton step feasible interior-point algorithm for P∗(κ)-LCP based on a new search direction
In this paper, we present a full-Newton step feasible interior-point algorithm for a P∗(κ) linear complementarity problem based on a new search direction. We apply a vector-valued function generated by a univariate function on nonlinear equations of the system which defines the central path. Further...
Main Authors: | Behrouz Kheirfam, Masoumeh Haghighi |
---|---|
Format: | Article |
Language: | English |
Published: |
Croatian Operational Research Society
2016-12-01
|
Series: | Croatian Operational Research Review |
Subjects: | |
Online Access: | http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=257103&lang=en |
Similar Items
-
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 Interior-Point Method for Weighted Quadratic Programming Based on the Algebraic Equivalent Transformation
by: Yongsheng Rao, et al.
Published: (2024-04-01) -
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
by: Goran Lešaja, et al.
Published: (2016-04-01) -
INFEASIBLE FULL NEWTON-STEP INTERIOR-POINT METHOD FOR LINEAR COMPLEMENTARITY PROBLEMS
by: Goran Lešaja, et al.
Published: (2012-12-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)