An iterative method based on Simpson's $3/8$ rule to solve absolute value equations

Document Type : Research Article

Authors

Department of Mathematics, National University of Skills (NUS), Tehran, Iran

Abstract

Newton's method is one of the important algorithms for solving absolute value equations. In this paper, we introduce an efficient two-step iterative method to improve the Newton algorithm. The new method adopts the predictor-corrector technique in which the first step is generalized Newton method and the second step is based on Simpson's $3/8$ rule.
Under some standard assumptions, the convergence of new method and its linear convergence rate are obtained. Numerical results show that the our method is efficient and robust to solve absolute value equations.

Keywords

Main Subjects


[1] L. Abdallah, M. Haddou, T. Migot, Solving absolute value equation using complementarity and
smoothing functions, J. Comput. Appl. Math. 327 (2018) 196–207.
[2] J.H. Alcantara, J.S. Chen, M.K. Tam, Method of alternating projections for the general absolute
value equation, Fixed Point Theory Appl. 25 (2023) 1-38.
[3] R. Ali, A. Ali, I. Khan, A. Mohamed, Two new generalized iteration methods for solving absolute
value equations using M-matrix, AIMS Mathematics 7 (2022) 8176–8187.
[4] R. Ali, K. Pan, New generalized Gauss-Seidel iteration methods for solving absolute value equa-
tions, Math. Methods Appl. Sci., https://doi.org/10.1002/mma.9062, 2023.
[5] R. Ali, K. Pan, The new iteration methods for solving absolute value equations, Appl. Math. 65
(2023) 109–122.
[6] R. Ali, Z. Zhang, Exploring two new iterative methods for solving absolute value equations, Appl.
Math. Comput. 70 (2024) 6245–6258.
[7] C. Chen, D. Yu, D. Han, Exact and inexact Douglas-Rachford splitting methods for solving large-
scale sparse absolute value equations, IMA J. Numer. Anal. 43 (2023) 1036–1060.
[8] C. Chen, B. Huang, D. Yu, D. Han, Optimal parameter of the SOR-like iteration method for solving
absolute value equations, Numer. Algorithms 96 (2024) 799–826.
[9] R.W. Cottle, J.S. Pang, R.E. Stone, The linear complementarity problem, SIAM, 1992.
[10] V. Edalatpour, D. Hezari, D.K. Salkuyeh, A generalization of the Gauss-Seidel iteration method for
solving absolute value equations, Appl. Math. Comput. 293 (2017) 156-167.
[11] A.J. Fakharzadeh, N.N. Shams, An efficient algorithm for solving absolute value equations, J. Math.
Ext. 15 (2021) 1-23.
[12] F.B. Hildebrand, Introduction to Numerical Analysis, 2nd Edition, McGraw-Hill, New York, 1994.
[13] M. Hladik, H. Moosaei, F. Hashemi, S. Ketabchi, P.M. Pardalos, An overview of absolute value
equations: from theory to solution methods and challenges, arXiv:2404.06319, 2024.
[14] S.L. Hu, Z.H. Huang, A note on absolute value equations, Optim. Lett. 4 (2010) 417–424.
[15] X.Q. Jiang, Y. Zhang, A smoothing-type algorithm for absolute value equations, J. Ind. Manag.
Optim. 9 (2013) 789–798.
[16] Y.F. Ke, C.F. Ma, SOR-like iteration method for solving absolute value equations, Appl. Math.
Comput. 311 (2017) 195–202.
[17] S. Ketabchi, H. Moosaei, Minimum norm solution to the absolute value equation in the convex case,
J. Optim. Theory Appl. 154 (2012) 1080–1087.
[18] S. Ketabchi, H. Moosaei, An efficient method for optimal correcting of absolute value equations by
minimal changes in the right hand side, Comput. Math. Appl. 64 (2012) 1882–1885.
[19] A. Khan, J. Iqbal, A. Akgul, R. Ali, Y. Du, A. Hussain, K.S. Nisar, V. Vijayakumar, A Newton-type
technique for solving absolute value equations, Alex. Eng. J. 64 (2023) 291–296.
[20] S. Kumar, D.M. Hladik, H. Moosaei, Characterization of unique solvability of absolute value equa-
tions: an overview, extensions, and future directions, Optim. Lett. 18 (2024) 889–907.
[21] O.L. Mangasarian, Absolute value programming, Comput. Optim. Appl. 36 (2007) 43–53.
[22] O.L. Mangasarian, A generalized Newton method for absolute value equations, Optim. Lett. 3
(2009) 101–108.
[23] O.L. Mangasarian, P.R. Meyer, Absolute value equations, Linear Algebra Appl. 419 (2006) 359–
367.
[24] X.H. Miao, K. Yao, C.Y. Yang, J.S. Chen, Levenberg-Marquardt method for absolute value equa-
tion associated with second-order cone, Nume. Algebra Control Optim. 12(1) (2022) 47–61.
[25] M.A. Noor, J. Iqbal, K.I. Noor, E. Al-Said, On an iterative method for solving absolute value
equations, Optim. Lett. 6 (2012) 1027–1033.
[26] H. Ren, X. Wang, X.B. Tang, T. Wang, The general two-sweep modulus-based matrix splitting
iteration method for solving linear complementarity problems, Comput. Math. Appl. 77 (2019)
1071–1081.
[27] J. Rohn, A theorem of the alternatives for the equation Ax + B|x| = b, Linear Multilinear Algebra
52(6) (2004) 421–426.
[28] J. Rohn, An algorithm for solving the absolute value equation, Electron. J. Linear Algebra 18 (2009)
589–599.
[29] J. Rohn, V. Hooshyarbakhsh, R. Farhadsefat, An iterative method for solving absolute value equa-
tions and sufficient conditions for unique solvability, Optim. Lett. 8 (2014) 35–44.
[30] D.K. Salkuyeh, The Picard-HSS iteration method for absolute value equations, Optim. Lett. 8
(2014) 2191–2202.
[31] J. Xie, H. Qi, D. Han, Randomized iterative methods for generalized absolute value equations:
Solvability and error bounds, https://doi.org/10.48550/arXiv.2405.04091, 2024.
[32] X. Wang, X. Li, L.H. Zhang, R.C. Li, An efficient numerical method for the symmetric positive
definite second-order cone linear complementarity problem, J. Sci. Comput. 79 (2019) 1608–1629.
[33] H. Wang, H. Liu, S. Cao, A verification method for enclosing solutions of absolute value equations,
Collect. Math. 64 (2013) 17–18.
[34] S.L Wu, C.X. Li, The unique solution of the absolute value equations, Appl. Math. Lett. 76 (2018)
195–200.
[35] S.L. Wu, C.X. Li, A note on unique solvability of the absolute value equation, Optim. Lett. 14
(2020) 1957–1960.
[36] N. Yilmaz, A. Sahiner, Smoothing techniques in solving non-Lipschitz absolute value equations,
Int. J. Comput. Math. 100 (2023) 867–879.
[37] L. Zheng, The Picard-HSS-SOR iteration method for absolute value equations, J. Inequal. Appl.
2020 (2020) 258.