2 papers
math.OC2026
A Relaxed Maximum-Based Normal -Iteration Method for Generalized Absolute Value Equations
Abhishek Kumar Singh Sengar, Bharat Kumar, Deepmala
A relaxed maximum-based normal -iteration method (RMNSI) is proposed for solving generalized absolute value equations (GAVEs). The method combines a maximum-based fixed-point fo…
math.OC2026
Solving Large-Scale Sparse Linear Complementarity Problems Using a Relaxed Shifted Matrix-Splitting Modulus-Based Iteration Method
Abhishek Kumar Singh Sengar, Bharat Kumar, Deepmala
A relaxed shifted matrix-splitting modulus-based iteration method is proposed for solving large-scale sparse linear complementarity problems. The method extends the classical modul…