COMPLEXITY ANALYSIS OF LARGE-UPDATE INTERIOR-POINT METHODS FOR ?∗(?)-HLCP BASED ON A NEW PARAMETRIC KERNEL FUNCTION

Authors

  • Mokrani Ibtissam Department of Mathematics, University of Batna 2, Algeria
  • Chalekh Randa Department of Mathematics, University of Batna 2, Algeria
  • Djeffal El Amir Department of Mathematics, University of Batna 2, Algeria

DOI:

https://doi.org/10.19139/soic-2310-5070-2345

Keywords:

$\mathcal{P}_*(\kappa)$-Horizontal Linear Complementarity Problem, interior-point methods, kernel function, large-update method

Abstract

This work proposes a primal-dual interior point technique for ?∗(?)-Horizontal Linear Complementarity Problem (?∗(?)-HLCP), based on a novel parameterized kernel function. Our new eligible parametric kernel function’s feature produces the following iteration bound ?(((?+1)(??)?+22(?+1)⁄???(??))) for the large-update method. Finally, we present numerical results demonstrating the algorithm’s pratical performance among various parameters.

Downloads

Published

2025-04-24

Issue

Section

Research Articles

How to Cite

COMPLEXITY ANALYSIS OF LARGE-UPDATE INTERIOR-POINT METHODS FOR ?∗(?)-HLCP BASED ON A NEW PARAMETRIC KERNEL FUNCTION. (2025). Statistics, Optimization & Information Computing, 14(1), 193-206. https://doi.org/10.19139/soic-2310-5070-2345