Simulated annealing algorithm for absolute value equations
by Hossein Moosaei; Hamed Jafari; Saeed Ketabchi
International Journal of Operational Research (IJOR), Vol. 30, No. 1, 2017

Abstract: The main goal of this paper is to compute the solution to the NP-hard absolute value equations (AVEs) Ax - |x| = b when the singular values of A exceed 1. First we show the AVE is equivalent to a bilinear programming problem and then we present a system tantamount to this problem. We use the simulated annealing (SA) algorithm to solve this system. Finally, several examples are given to illustrate the implementation and efficiency of the proposed method.

Online publication date: Fri, 21-Jul-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com