Skip to main content
SpringerLink
Log in

On equivalent reformulations for absolute value equations

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

In this note we consider absolute value equations (AVE) of the type Ax+B|x|=c. We discuss unique solvability of AVE, and its relations with linear complementarity problem (LCP) and mixed integer programming.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  2. Mangasarian, O.L.: Absolute value equation solution via concave minimization. Optim. Lett. 1(1), 3–8 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Mangasarian, O.L.: Absolute value programming. Comput. Optim. Appl. 36, 43–53 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  4. Mangasarian, O.L., Meyer, R.R.: Absolute value equations. Linear Algebra Appl. 419, 359–367 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Murty, K.G.: Linear Complementarity, Linear and Nonlinear Programming. Helderman, Berlin (1988). Internet version is available at http://www-personal.umich.edu/~murty/

    MATH  Google Scholar 

  6. Papadimitriou, C.H.: On the complexity of unique solution. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 14–20 (1982)

  7. Pardalos, P.M.: Linear complementarity problems solvable by integer programming. Optimization 19, 467–474 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  8. Pardalos, P.M.: The linear complementarity problem. In: Gomez, S., Hennart, J.P. (eds.) Advances in Optimization and Numerical Analysis, pp. 39–49. Kluwer Academic, Dordrecht (1994)

    Google Scholar 

  9. Pardalos, P.M., Jha, S.: Complexity of uniqueness and local search in quadratic 0–1 programming. Oper. Res. Lett. 11, 119–123 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Pardalos, P.M., Rosen, J.B.: Global optimization approach to the linear complementarity problem. SIAM J. Sci. Statist. Comput. 9, 341–353 (1988)

    Article  MathSciNet  Google Scholar 

  11. Prokopyev, O.A., Huang, H.-X., Pardalos, P.M.: On complexity of unconstrained hyperbolic 0–1 programming problems. Oper. Res. Lett. 33, 312–318 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. Rohn, J.: A theorem of the alternatives for the equation Ax+B|x|=b. Linear Algebra Appl. 52, 421–426 (2004)

    MATH  MathSciNet  Google Scholar 

  13. Rosen, J.: Minimum norm solution to the linear complementarity problem. In: Leifman, L.J. (ed.) Functional Analysis, Optimization and Economics, pp. 208–216. Oxford University Press, New York (1990)

    Google Scholar 

  14. Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theor. Comput. Sci. 47, 85–93 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  15. ILOG Inc.: CPLEX 9.0 User’s Manual (2004)

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, PA, 15261, USA

    Oleg Prokopyev

Authors
  1. Oleg Prokopyev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oleg Prokopyev.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prokopyev, O. On equivalent reformulations for absolute value equations. Comput Optim Appl 44, 363–372 (2009). https://doi.org/10.1007/s10589-007-9158-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-007-9158-1

Keywords

Search

Navigation