Abstract
In this paper, we study the absolute value equation (AVE) Ax- b= | x|. One effective approach to handle AVE is by using concave minimization methods. We propose a new method based on concave minimization methods. We establish its finite convergence under mild conditions. We also study some classes of AVEs which are polynomial time solvable.
Original language | English |
---|---|
Pages (from-to) | 2241-2254 |
Journal | Optimization Letters |
Volume | 15 |
Issue number | 6 |
DOIs | |
Publication status | Published - 5 Sept 2021 |
Keywords
- Absolute value equation
- Concave minimization algorithms
- Linear complementarity problem