A generalization of the Gauss-Seidel iteration method for generalized absolute value equations
Preprint
Abstract
A parameter-free method, namely the generalization of the Gauss-Seidel (GGS) method, is developed to solve generalized absolute value equations. Convergence of the proposed method is analyzed. Numerical results are given to demonstrate the effectiveness and efficiency of the GGS method. Some results in the recent work of Edalatpour et al. \cite{edhs2017} are extended.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Shift-splitting fixed point iteration method for solving generalized absolute value equationsNumerical Algorithms, 2022
- A note on unique solvability of the absolute value equationOptimization Letters, 2019
- Modified Newton-Type Iteration Methods for Generalized Absolute Value EquationsJournal of Optimization Theory and Applications, 2018
- Accelerated modulus-based matrix splitting iteration methods for linear complementarity problemNumerical Algorithms, 2012
- An iterative method for solving absolute value equations and sufficient conditions for unique solvabilityOptimization Letters, 2012
- On unique solvability of the absolute value equationOptimization Letters, 2009
- A generalized Newton method for absolute value equationsOptimization Letters, 2008
- On equivalent reformulations for absolute value equationsComputational Optimization and Applications, 2007
- Absolute value programmingComputational Optimization and Applications, 2006
- Component‐based iterative methods for sparse linear systemsConcurrency and Computation: Practice and Experience, 2006