Convergence results for some piecewise linear solvers

@article{Radons2021ConvergenceRF,
  title={Convergence results for some piecewise linear solvers},
  author={Manuel Radons and Siegfried M. Rump},
  journal={ArXiv},
  year={2021},
  volume={abs/2012.02520}
}
<jats:p>Let <jats:italic>A</jats:italic> be a real <jats:inline-formula><jats:alternatives><jats:tex-math>$$n\times n$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>×</mml:mo> <mml:mi>n</mml:mi> </mml:mrow> </mml:math></jats:alternatives></jats:inline-formula> matrix and <jats:inline-formula><jats:alternatives><jats:tex-math>$$z,b… 

References

SHOWING 1-10 OF 24 REFERENCES
$$\mathcal O(n)$$O(n) working precision inverses for symmetric tridiagonal Toeplitz matrices with $$\mathcal O(1)$$O(1) floating point calculations
TLDR
A linear time algorithm for an explicit tridiagonal inversion that only uses O(1) floating point operations is constructed and the cornerstones for an efficient parallelizable approximative equation solver are outlined.
Representation and Analysis of Piecewise Linear Functions in Abs-Normal Form
TLDR
The system of equations \(F(x) = 0\) can be rewritten in terms of the variable vector \(z\) as a linear complementarity problem (LCP) and the transformation itself and the properties of the LCP depend on the Schur complement.
Nondegenerate Piecewise Linear Systems: A Finite Newton Algorithm and Applications in Machine Learning
TLDR
An effective damped Newton method, PLS-DN, to find the exact (up to machine precision) solution of nondegenerate PLSs, which exhibits provable semiiterative property, that is, the algorithm converges globally to the exact solution in a finite number of iterations.
Direct solution of piecewise linear systems
  • Manuel Radons
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2016
Absolute value equation solution via concave minimization
TLDR
A simple MATLAB implementation of the successive linearization algorithm solved 100 consecutively generated 1,000-dimensional random instances of the AVE with only five violated equations out of a total of 100,000 equations.
Iterative Solution of Piecewise Linear Systems
TLDR
In the present paper a simple Newton-type procedure for certain piecewise linear systems is derived and shown to have a finite termination property, i.e., it converges to the exact solution in a finite number of steps.
Absolute value programming
TLDR
This work investigates equations, inequalities and mathematical programs involving absolute values of variables such as the equation Ax+B|x| = b and shows that this absolute value equation is NP-hard to solve, and that solving it with B = I solves the general linear complementarity problem.
Absolute Value Equation Solution Via Linear Programming
TLDR
A new linear programming method for solving the NP-hard absolute value equation (AVE): Ax−|x|=b, where A is an n×n square matrix that consists of solving a few linear programs, typically less than four.
...
1
2
3
...