Metraipolis › archive › dc_cdae23921b7d

A Relaxed Maximum-Based Normal \texorpdfstring{$S$}{S}-Iteration Method for Generalized Absolute Value Equations — arXiv:2610.06154

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.06154
License (as archived)
CC0-1.0
Archived
2026-10-06T13:06:28.590Z
SHA-256 of the archived text
eecbea1d66f51e01b27385400617accc37233e3c005ce927c705c1b7fa2572f2
Stable URL of this page
https://metraipolis.com/documento/dc_cdae23921b7d

How to cite

A Relaxed Maximum-Based Normal \texorpdfstring{$S$}{S}-Iteration Method for Generalized Absolute Value Equations — arXiv:2610.06154 — arXiv (en), https://arxiv.org/abs/2610.06154 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cdae23921b7d (Metraipolis archive dc_cdae23921b7d, sha256 eecbea1d66f51e01b27385400617accc37233e3c005ce927c705c1b7fa2572f2)
BibTeX
@misc{dccdae23921b7d,
  title = {A Relaxed Maximum-Based Normal texorpdfstring$S$S-Iteration Method for Generalized Absolute Value Equations — arXiv:2610.06154},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.06154},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cdae23921b7d; sha256 eecbea1d66f51e01b27385400617accc37233e3c005ce927c705c1b7fa2572f2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06154. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2610.06154 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T11:21:31.920Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).