Some notes on the solvability conditions for absolute value equations

Published: 01 Jan 2023, Last Modified: 06 Jan 2025Optim. Lett. 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Motivated by recently published papers, we discuss the problem of solving absolute value equations of the form \(Ax+|x|=b\). Specifically, we show the equivalence of two sufficient conditions for the unsolvability of such equations which are based on linear programming. Furthermore, we prove that two generalizations of sufficient conditions for unique solvability do not extend the class at all, that is, they are equivalent to the original formulations. The conditions based on M-matrices and H-matrices also turn out to be special cases of the known statements. Eventually, we also point out two incorrect statements, and for one of them, we propose some corrected reformulations.
Loading

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview