Abstract
In this paper, we introduce a modified Barzilai-Borwein algorithm for solving the generalized absolute value equation Ax+B|x|=b. We discuss the global convergence of the proposed algorithm under the proper conditions. Finally, numerical results demonstrate the feasibility and efficiency of the proposed algorithm and overmatch some existing algorithms, such as the SOR-like algorithm, the GN algorithm and the sign accord algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
