A generalization of the Newton-based matrix splitting iteration method for generalized absolute value equations

09/18/2023
by   Xuehua Li, et al.
0

A generalization of the Newton-based matrix splitting iteration method (GNMS) for solving the generalized absolute value equations (GAVEs) is proposed. Under mild conditions, the GNMS method converges to the unique solution of the GAVEs. Moreover, we can obtain a few weaker convergence conditions for some existing methods. Numerical results verify the effectiveness of the proposed method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2021

A New Modified Newton-Type Iteration Method for Solving Generalized Absolute Value Equations

For the large sparse generalized absolute value equations (GAVEs) , the ...
research
12/01/2020

A relaxation accelerated two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems

For a linear complementarity problem, we present a relaxaiton accelerate...
research
01/09/2022

Global monotone convergence of Newton-like iteration for a nonlinear eigen-problem

The nonlinear eigen-problem Ax+F(x)=λ x is studied where A is an n× n ir...
research
03/17/2021

An inexact Douglas-Rachford splitting method for solving absolute value equations

The last two decades witnessed the increasing of the interests on the ab...
research
11/27/2021

A non-monotone smoothing Newton algorithm for solving the system of generalized absolute value equations

The system of generalized absolute value equations (GAVE) has attracted ...
research
07/10/2022

On finite termination of the generalized Newton method for solving absolute value equations

Motivated by the framework constructed by Brugnano and Casulli [SIAM J. ...
research
01/16/2020

Optimal parameter for the SOR-like iteration method for solving the system of absolute value equations

The absolute value equations (AVE) Ax - |x| - b = 0 is of interest of th...

Please sign up or login with your details

Forgot password? Click here to reset