A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
From MaRDI portal
Publication:5278831
DOI10.2298/YJOR130515034AzbMath1474.90468MaRDI QIDQ5278831
Soodabeh Asadi, Hossein Mansouri
Publication date: 19 July 2017
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (9)
A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function ⋮ An infeasible interior-point method with improved centering steps for monotone linear complementarity problems ⋮ An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path ⋮ An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ A Corrector-Predictor Interior-Point Algorithm for P∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones ⋮ An infeasible interior point method for the monotone SDLCP based on a transformation of the central path ⋮ Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP ⋮ A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
This page was built for publication: A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
