Siegfried M. Rump | Searcharxiv

arXiv2021

Sign controlled solvers for the absolute value equation with an application to support vector machines

Let $A$ be a real $n\times n$ matrix and $z,b\in \mathbb R^n$. The piecewise linear equation system $z-A\vert z\vert = b$ is called an absolute value equation. It is equivalent to the general linear complementarity problem, and thus NP hard in general. Concerning the latter problem, three solvers are presented: One direct, one semi-iterative and one discrete variant of damped Newton. Their previously proved ranges of correctness and convergence, respectively, are extended. Their performance is compared on instances of the XOR separation problem for support vector machines which can be reformulated as an absolute value equation.

math.NA↗

arXiv2020

Convergence results for some piecewise linear solvers

Let $A$ be a real $n\times n$ matrix and $z,b\in \mathbb R^n$. The piecewise linear equation system $z-A\vert z\vert = b$ is called an \textit{absolute value equation}. We consider two solvers for this problem, one direct, one semi-iterative, and extend their previously known ranges of convergence.

math.NA↗