Computational Optimization and Applications

, Volume 36, Issue 1, pp 43–53 | Cite as

Absolute value programming



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.


Absolute value (AV) equations AV algorithm AV theorems of alternative AV duality 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S.-J. Chung and K.G. Murty, “Polynomially bounded ellipsoid algorithms for convex quadratic programming,” In Nonlinear Programming O.L. Mangasarian, R.R. Meyer, and S.M. Robinson (Eds.), Academic Press, New York, 1981, vol. 4, pp. 439–485.Google Scholar
  2. 2.
    R.W. Cottle and G. Dantzig, “Complementary pivot theory of mathematical programming,” Linear Algebra and its Applications, vol. 1, pp. 103–125, 1968.CrossRefMathSciNetGoogle Scholar
  3. 3.
    R.W. Cottle, J.-S. Pang, and R.E. Stone, The Linear Complementarity Problem, Academic Press, New York, 1992.MATHGoogle Scholar
  4. 4.
    CPLEX Optimization Inc., Incline Village, Nevada. Using the CPLEX(TM) Linear Optimizer and CPLEX(TM) Mixed Integer Optimizer (Version 2.0), 1992.Google Scholar
  5. 5.
    O.L. Mangasarian, Nonlinear Programming, Reprint: SIAM Classic in Applied Mathematics 10, 1994, Philadelphia, McGraw–Hill, New York, 1969.Google Scholar
  6. 6.
    O.L. Mangasarian, “The linear complementarity problem as a separable bilinear program,” J. Global Optim., vol. 6, pp. 153–161, 1995.CrossRefMathSciNetGoogle Scholar
  7. 7.
    O.L. Mangasarian, “Solution of general linear complementarity problems via nondifferentiable concave minimization,” Acta Mathematica Vietnamica, vol. 22, no. 1, pp. 199–205, 1997,
  8. 8.
    O.L. Mangasarian and R.R. Meyer, “Nonlinear perturbation of linear programs,” SIAM Journal on Control and Optimization, vol. 17, no. 6, pp. 745–752, 1979.CrossRefMathSciNetGoogle Scholar
  9. 9.
    MATLAB. User’s Guide. The MathWorks, Inc., Natick, MA 01760, 1994–2001.
  10. 10.
    R.T. Rockafellar, Convex Analysis Princeton University Press, Princeton, New Jersey, 1970.MATHGoogle Scholar
  11. 11.
    J. Rohn, “Systems of linear interval equations,” Linear Algebra and Its Applications, vol. 126, pp. 39–78, 1989.
  12. 12.
    J. Rohn, “A theorem of the alternatives for the equation A x+B|x| = b,” Linear and Multilinear Algebra, vol. 52, no. 6, pp. 421–426, 2004.

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Computer Sciences DepartmentUniversity of WisconsinMadison

Personalised recommendations