On equivalent reformulations for absolute value equations

Authors:
Oleg Prokopyev
Affiliations:
Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, USA 15261
Venue:
Computational Optimization and Applications
Year:
2009

Citing 6
Cited 3

NP is as easy as detecting unique solutions

Theoretical Computer Science
Global optimization approach to the linear complementarity problem

SIAM Journal on Scientific and Statistical Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Absolute value programming

Computational Optimization and Applications
On the complexity of unique solutions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
On complexity of unconstrained hyperbolic 0-1 programming problems

Operations Research Letters

A generalized Newton method for absolute value equations associated with second order cones

Journal of Computational and Applied Mathematics
An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side

Computers & Mathematics with Applications
Equilibrium problems involving the Lorentz cone

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

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.