Author:
Anane Nassima,Achache Mohamed
Abstract
We investigate the NP-hard absolute value equations (AVE), \(Ax-B|x| =b\), where \(A,B\) are given symmetric matrices in \(\mathbb{R}^{n\times n}, \ b\in \mathbb{R}^{n}\).By reformulating the AVE as an equivalent unconstrained convex quadratic optimization, we prove that the unique solution of the AVE is the unique minimum of the corresponding quadratic optimization. Then across the latter, we adopt the preconditioned conjugate gradient methods to determining an approximate solution of the AVE.The computational results show the efficiency of these approaches in dealing with the AVE.
Publisher
Academia Romana Filiala Cluj
Reference18 articles.
1. M. Achache and N. Hazzam. Solving absolute value equations via linear comple-mentarity and interior-point methods. Journal of Nonlinear Functional Analysis, 2018,pp. 1–10. https://doi.org/10.23952/jnfa.2018.39
2. M. A. Noor, J. Iqbal and E. Al-Said, Residual iterative method for solving absolutevalue equations. Article ID 406232. (2012), pp. 1–9. https://doi.org/10.1155/2012/406232
3. R. W. Cottle, J. S. Pang and R. E. Stone, The Linear Complementarity Problem. Academic Press. New-York (1992).
4. R. Fletcher, Practical Methods of Optimization. John Wiley and Sons. New-York(1987).
5. R. Fletcher and C.M. Reeves, Functions minimization by conjugate gradients. Computational journal.7, (1964), pp.149-154, https://doi.org/10.1093/comjnl/7.2.149
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献