{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T12:38:51Z","timestamp":1776170331143,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,4,14]],"date-time":"2015-04-14T00:00:00Z","timestamp":1428969600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11590-015-0893-4","type":"journal-article","created":{"date-parts":[[2015,4,13]],"date-time":"2015-04-13T19:23:00Z","timestamp":1428952980000},"page":"1469-1474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["A hybrid algorithm for solving the absolute value equation"],"prefix":"10.1007","volume":"9","author":[{"given":"Olvi L.","family":"Mangasarian","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,14]]},"reference":[{"key":"893_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00940344","volume":"60","author":"S-J Chung","year":"1989","unstructured":"Chung, S.-J.: NP-completeness of the linear complementarity problem. J. Optim. Theory Appl. 60, 393\u2013399 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"893_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(68)90052-9","volume":"1","author":"RW Cottle","year":"1968","unstructured":"Cottle, R.W., Dantzig, G.: Complementary pivot theory of mathematical programming. Linear Algebra Appl. 1, 103\u2013125 (1968)","journal-title":"Linear Algebra Appl."},{"key":"893_CR3","volume-title":"The Linear Complementarity Problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, New York (1992)"},{"issue":"3","key":"893_CR4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s11590-009-0169-y","volume":"4","author":"H Sheng-Long","year":"2010","unstructured":"Sheng-Long, H., Huang, Z.-H.: A note on absolute equations. Optim. Lett. 4(3), 417\u2013424 (2010)","journal-title":"Optim. Lett."},{"key":"893_CR5","unstructured":"ILOG (2003) Incline Village, Nevada. ILOG CPLEX 9.0 User\u2019s Manual. http:\/\/www.ilog.com\/products\/cplex\/"},{"key":"893_CR6","unstructured":"Mangasarian, O.L.: Solution of general linear complementarity problems via nondifferentiable concave minimization. Acta Mathematica Vietnamica 22(1), 199\u2013205 (1997). ftp:\/\/ftp.cs.wisc.edu\/math-prog\/tech-reports\/96-10.ps"},{"key":"893_CR7","doi-asserted-by":"crossref","unstructured":"Mangasarian, O.L.: Absolute value equation solution via concave minimization. Optim. Lett. 1(1), 3\u20138 (2007). ftp:\/\/ftp.cs.wisc.edu\/pub\/dmi\/tech-reports\/06-02","DOI":"10.1007\/s11590-006-0005-6"},{"key":"893_CR8","doi-asserted-by":"crossref","unstructured":"Mangasarian, O.L.: Absolute value programming. Comput. Optim. Appl. 36(1), 43\u201353 (2007). ftp:\/\/ftp.cs.wisc.edu\/pub\/dmi\/tech-reports\/05-04.ps","DOI":"10.1007\/s10589-006-0395-5"},{"key":"893_CR9","unstructured":"Mangasarian, O.L.: A generalized Newton method for absolute value equations. Technical Report 08\u201301, Data Mining Institute, Computer Sciences Department, University of Wisconsin, May 2008. ftp:\/\/ftp.cs.wisc.edu\/pub\/dmi\/tech-reports\/08-01 . Optim. Lett. 3(1), 101\u2013108 (2009). http:\/\/www.springerlink.com\/content\/c076875254r7tn38\/"},{"key":"893_CR10","unstructured":"Mangasarian, O.L.: Absolute value equation solution via dual complementarity. Technical report, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, September 2011. ftp:\/\/ftp.cs.wisc.edu\/pub\/dmi\/tech-reports\/11-03 . Optim. Lett. 7(4), 625\u2013630 (2013)"},{"key":"893_CR11","unstructured":"Mangasarian, O.L.: Primal-dual bilinear programming solution of the absolute value equation. Technical report, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, February 2011. ftp:\/\/ftp.cs.wisc.edu\/pub\/dmi\/tech-reports\/11-01 . Optim. Lett. 6(7), 1527\u20131533 (2012)"},{"key":"893_CR12","unstructured":"Mangasarian, O.L.: Absolute value equation solution via linear programming. Technical Report 13\u201301, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, February 2013. ftp:\/\/ftp.cs.wisc.edu\/pub\/dmi\/tech-reports\/13-01 . J. Optim. Theory Appl. 161, 870\u2013876 (2014)"},{"key":"893_CR13","doi-asserted-by":"crossref","unstructured":"Mangasarian, O.L., Meyer, R.R.: Absolute value equations. Linear Algebra Appl. 419, 359\u2013367 (2006). ftp:\/\/ftp.cs.wisc.edu\/pub\/dmi\/tech-reports\/05-06","DOI":"10.1016\/j.laa.2006.05.004"},{"key":"893_CR14","unstructured":"MATLAB. User\u2019s Guide. The MathWorks Inc, Natick, MA 01760. http:\/\/www.mathworks.com (2006). Accessed 19 April 2014"},{"issue":"3","key":"893_CR15","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s10589-007-9158-1","volume":"44","author":"OA Prokopyev","year":"2009","unstructured":"Prokopyev, O.A.: On equivalent reformulations for absolute value equations. Comput. Optim. Appl. 44(3), 363\u2013372 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"893_CR16","doi-asserted-by":"crossref","unstructured":"Rohn, J.: A theorem of the alternatives for the equation $${A}x+{B}|x|=b$$ A x + B | x | = b . Linear Multilinear Algebra 52(6), 421\u2013426, 2004. http:\/\/www.cs.cas.cz\/rohn\/publist\/alternatives","DOI":"10.1080\/0308108042000220686"},{"key":"893_CR17","first-page":"589","volume":"18","author":"J Rohn","year":"2009","unstructured":"Rohn, J.: An algorithm for solving the absolute value equation. Electron. J. Linear Algebra 18, 589\u2013599 (2009)","journal-title":"Electron. J. Linear Algebra"},{"key":"893_CR18","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s11590-009-0129-6","volume":"3","author":"J Rohn","year":"2009","unstructured":"Rohn, J.: On unique solvability of the absolute value equation. Optim. Lett. 3, 603\u2013606 (2009)","journal-title":"Optim. Lett."},{"issue":"2","key":"893_CR19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s11590-009-0160-7","volume":"4","author":"J Rohn","year":"2010","unstructured":"Rohn, J.: A residual existence theorem for linear equations. Optim. Lett. 4(2), 287\u2013292 (2010)","journal-title":"Optim. Lett."},{"key":"893_CR20","doi-asserted-by":"crossref","unstructured":"Rohn, J.: An algorithm for computing all solutions of an absolute value equation. Optim. Lett. 6, 851\u2013856 (2012)","DOI":"10.1007\/s11590-011-0305-3"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0893-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0893-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0893-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:42Z","timestamp":1559409102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0893-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,14]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["893"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0893-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,14]]}}}