arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.06457math.NAcs.NAmath.OC
收藏

绝对值方程组解集的性质及相关矩阵类

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

Charles University, Faculty of Mathematics and Physics(查理大学数学与物理学院)

Milan Hladík

AI总结:

本文研究绝对值方程 Ax+|x|=b 的解集拓扑与非负解性质,刻画相关矩阵类及其识别复杂性,并给出 NP 难情形的充分条件。

摘要:

绝对值方程(AVE)问题是求解 Ax+|x|=b 的代数问题。迄今为止,大多数研究集中于求解 AVE 的方法,但我们通过分析 AVE 及其相应解集的性质来处理该问题本身。具体而言,我们研究解集的拓扑性质,例如凸性、有界性、连通性,或其是否由有限多个解组成。此外,我们处理与解的非负性相关的问题,如可解性或唯一可解性。AVE 可以借助不同的优化问题来表述,在这方面,我们关注 AVE 的解如何与这些优化问题的最优解、Karush-Kuhn-Tucker 点和可行解相关联。我们刻画了与上述性质相关的矩阵类,并考察识别问题的计算复杂性;其中一些矩阵类可在多项式时间内识别,但另一些被证明是 NP 难的。对于难解情形,我们提出了各种充分条件。我们还提出了在研究该问题过程中出现的新的挑战性问题。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑