# Absolute value programming

- First Online:

- Received:
- Revised:

DOI: 10.1007/s10589-006-0395-5

- Cite this article as:
- Mangasarian, O.L. Comput Optim Applic (2007) 36: 43. doi:10.1007/s10589-006-0395-5

- 47 Citations
- 320 Views

## Abstract

We investigate equations, inequalities and mathematical programs involving absolute values of variables such as the equation *Ax*+*B*|*x*| = *b*, where *A* and *B* are arbitrary *m*× *n* real matrices. We show that this absolute value equation is NP-hard to solve, and that solving it with *B* = *I* solves the general linear complementarity problem. We give sufficient optimality conditions and duality results for absolute value programs as well as theorems of the alternative for absolute value inequalities. We also propose concave minimization formulations for absolute value equations that are solved by a finite succession of linear programs. These algorithms terminate at a local minimum that solves the absolute value equation in almost all solvable random problems tried.