Show simple item record

dc.contributor.authorMangasarian, Olvi
dc.date.accessioned2013-01-17T18:34:02Z
dc.date.available2013-01-17T18:34:02Z
dc.date.issued2011
dc.identifier.citation11-01en
dc.identifier.urihttp://digital.library.wisc.edu/1793/64356
dc.description.abstractWe propose a finitely terminating primal-dual bilinear programming algorithm for the solution of the NP-hard absolute value equation (AVE): Ax ? |x| = b, where A is an n � n square matrix. The algorithm, which makes no assumptions on AVE other than solvability, consists of a finite number of linear programs terminating at a solution of the AVE or at a stationary point of the bilinear program. The proposed algorithm was tested on 500 consecutively generated random instances of the AVE with n =10, 50, 100, 500 and 1,000. The algorithm solved 88.6% of the test problems to an accuracy of 1e ? 6 .en
dc.subjectlinear programmingen
dc.subjectbilinear programmingen
dc.subjectabsolute value equationsen
dc.titlePrimal-Dual Bilinear Programming Solution of the Absolute Value Equationen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • DMI Technical Reports
    DMI Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record