A Relaxed Maximum-Based Normal S-Iteration Method for Generalized Absolute Value Equations
Abstract
A relaxed maximum-based normal S-iteration method (RMNSI) is proposed for solving generalized absolute value equations (GAVEs). The method combines a maximum-based fixed-point formulation with a constant relaxation parameter and avoids the selection of an auxiliary matrix. Assuming that A+B is non-singular, both stages require linear systems with the same coefficient matrix A+B, allowing a single factorization to be reused throughout the iteration. A single spectral condition is established that guarantees unique solvability of the GAVE and global convergence from an arbitrary initial vector. An admissible range of the relaxation parameter is characterized, and R-linear convergence and error estimates are derived. Since the global condition can be conservative, a local convergence analysis based on the solution sign pattern is also presented. Numerical experiments on complementarity-derived, dense mixed-sign, and asymmetric ridge-regression problems are presented, and comparisons with several recent methods demonstrate the competitive efficiency and accuracy of RMNSI. The results further indicate that the preferred relaxation parameter depends mainly on the matrix structure and diagonal shift, while its dependence on the problem dimension is generally weak.
Related
- Iterative Methods for Solving New Generalized Absolute Value Equations
- Solving Large-Scale Sparse Linear Complementarity Problems Using a Relaxed Shifted Matrix-Splitting Modulus-Based Iteration Method
- Amortized Score-Hamiltonian Policy Iteration: A Grid-Free Scheme for Relaxed Stochastic Control Problems
- Uniform Decay for Ruggeri's Relaxed Navier-Stokes-Fourier Equations
- Generalized Reimpell-Werner Iteration
BibTeX
@misc{sengar2026relaxed,
title = {{A Relaxed Maximum-Based Normal $S$-Iteration Method for Generalized Absolute Value Equations}},
author = {Abhishek Kumar Singh Sengar and Bharat Kumar and Deepmala},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.06154},
eprint = {2610.06154},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.06154},
}
RIS
TY - UNPB
TI - A Relaxed Maximum-Based Normal S-Iteration Method for Generalized Absolute Value Equations
AU - Abhishek Kumar Singh Sengar
AU - Bharat Kumar
AU - Deepmala
PY - 2026
DA - 2026/10/06
PB - arXiv
DO - 10.48550/arxiv.2610.06154
UR - https://arxiv.org/abs/2610.06154
AB - A relaxed maximum-based normal S-iteration method (RMNSI) is proposed for solving generalized absolute value equations (GAVEs). The method combines a maximum-based fixed-point formulation with a constant relaxation parameter and avoids the selection of an auxiliary matrix. Assuming that A+B is non-singular, both stages require linear systems with the same coefficient matrix A+B, allowing a single factorization to be reused throughout the iteration. A single spectral condition is established that guarantees unique solvability of the GAVE and global convergence from an arbitrary initial vector. An admissible range of the relaxation parameter is characterized, and R-linear convergence and error estimates are derived. Since the global condition can be conservative, a local convergence analysis based on the solution sign pattern is also presented. Numerical experiments on complementarity-derived, dense mixed-sign, and asymmetric ridge-regression problems are presented, and comparisons with several recent methods demonstrate the competitive efficiency and accuracy of RMNSI. The results further indicate that the preferred relaxation parameter depends mainly on the matrix structure and diagonal shift, while its dependence on the problem dimension is generally weak.
ER -