Properties of the solution set of absolute value equations and the related matrix classes

by   Milan Hladík, et al.

The absolute value equations (AVE) problem is an algebraic problem of solving Ax+|x|=b. So far, most of the research focused on methods for solving AVEs, but we address the problem itself by analysing properties of AVE and the corresponding solution set. In particular, we investigate topological properties of the solution set, such as convexity, boundedness, connectedness, or whether it consists of finitely many solutions. Further, we address problems related to nonnegativity of solutions such as solvability or unique solvability. AVE can be formulated by means of different optimization problems, and in this regard we are interested in how the solutions of AVE are related with optima, Karush-Kuhn-Tucker points and feasible solutions of these optimization problems. We characterize the matrix classes associated with the above mentioned properties and inspect the computational complexity of the recognition problem; some of the classes are polynomially recognizable, but some others are proved to be NP-hard. For the intractable cases, we propose various sufficient conditions. We also post new challenging problems that raised during the investigation of the problem.


page 1

page 2

page 3

page 4


Absolute value linear programming

We deal with linear programming problems involving absolute values in th...

A Collection of Challenging Optimization Problems in Science, Engineering and Economics

Function optimization and finding simultaneous solutions of a system of ...

On the unique solution of the generalized absolute value equation

In this paper, some useful necessary and sufficient conditions for the u...

A branch and bound technique for finding the minimal solutions of the linear optimization problems subjected to Lukasiewicz

In this paper, an optimization model with a linear objective function su...

On the Complexity of Optimization Problems based on Compiled NNF Representations

Optimization is a key task in a number of applications. When the set of ...

Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation

We propose GM-QAOA, a variation of the Quantum Alternating Operator Ansa...

Please sign up or login with your details

Forgot password? Click here to reset