Abstract
This paper mainly aims to obtain a minimum norm solution to the NP-hard absolute value equations (AVE) \(Ax-|x|=b\). In our proposed method, first we show that the AVE is equivalent to a bilinear programming problem and then we present a system tantamount to this problem. To find the minimum norm solution to the AVE, we solve a quadratic programming problem with quadratic and linear constraints. Eventually, we solve the obtained programming problem by Simulated Annealing algorithm. Numerical results support the efficiency of the proposed method and the high accuracy of calculation.
Similar content being viewed by others
References
Pardalos, P.M., Ketabchi, S., Moosaei, H.: Minimum norm solution to the positive semidefinite linear complementarity problem. Optimization 63(3), 359–369 (2014)
Pardalos, P.M., Rosen, J.B.: Global optimization approach to the linear complementarity problem. SIAM J. Sci. Stat. Comput. 9, 341–353 (1988)
Pardalos, P.M., Ye, Y.: Class of linear complementarity problems solvable in polynomial time. Linear Algebra Appl. 152, 3–17.99 (1991)
Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming Therory and Algorithms. Wiely, USA (1999)
Cottle, R.W., Dantzig, G.: Complementary pivot theory of mathematical programming. Linear Algebra Appl. 1, 103–125 (1968)
Cottle, R.W., Dantzig, G.: The Linear Complementarity Problem. Academic Press, New York (1992)
Mangasarian, O.L., Meyer, R.R.: Absolute value equations. Linear Algebra Appl. 419, 359367 (2006)
Mangasarian, O.L.: A generalized Newton method for absolute value equations. Optim. Lett. 3(1), 101108 (2009)
Zhang, C., Wei, Q.J.: Global and finite convergence of a generalized Newton method for absolute value equations. J. Optim. Theory Appl. 143, 391–403 (2009)
Longquan, Y.: Particle swarm optimization for absolute value equations. J. Comput. Inf. Syst. 7, 2359–2366 (2010)
Noor, M.A., Iqbal, J., Noor, K.I., Al-Said, E.: On an iterative method for solving absolute value equations. Optim. Lett. doi: 10.1007/s11590-011-0332-0
Noor, M.A., Iqbal, J., Khattri, S., Al-Said, E.: A new iterative method for solving absolute value equations. Int. J. Phys. Sci. 6(7), 1793–1797 (2011)
Mangasarian, O.L.: Absolute value programming. Comput. Optim. Appl. 36(1), 4353 (2007)
Mangasarian, O.L.: Absolute value equation solution via concave minimization. Optim. Lett. 1, 38 (2007)
Yong, L., Liu, S., Zhang, S., Deng, F.: A new method for absolute value equations based on harmony search algorithm. ICIC Express Lett. Part B Appl. 2(6), 1231–1236 (2011)
Rohn, J.: An algorithm for computing all solutions of an absolute value equation. Optim. Lett. 6(5), 851–856 (2012)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. 220, 671–680 (1983)
Corny, A.: Theorem dynamical approach to the TSP. J. Optim. Theory Appl. 45, 41–51 (1985)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Moosaei, H., Ketabchi, S. & Jafari, H. Minimum norm solution of the absolute value equations via simulated annealing algorithm. Afr. Mat. 26, 1221–1228 (2015). https://doi.org/10.1007/s13370-014-0281-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13370-014-0281-8