Loading...

Minimum norm solution of the absolute value equations via simulated annealing algorithm

Moosaei, H ; Sharif University of Technology | 2015

330 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s13370-014-0281-8
  3. Publisher: Springer Verlag , 2015
  4. Abstract:
  5. This paper mainly aims to obtain a minimum norm solution to the NP-hard absolute value equations (AVE) $$Ax-|x|=b$$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
  6. Keywords:
  7. Absolute value equations ; Minimum norm solution ; Quadratic programming ; Simulated Annealing algorithm
  8. Source: Afrika Matematika ; Volume 26, Issue 7-8 , December , 2015 , Pages 1221-1228 ; 10129405 (ISSN)
  9. URL: http://link.springer.com/article/10.1007/s13370-014-0281-8