A new class of fixed point methods for solving absolute value equations
From MaRDI portal
Cites work
- Absolute value equation solution via concave minimization
- Absolute value equations
- Absolute value equations with tensor product structure: unique solvability and numerical solution.
- Absolute value programming
- An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem
- An improvement on a class of fixed point iterative methods for solving absolute value equations
- Another HSS iteration method
- Differential equations containing absolute values of derivates.
- Exact and inexact Douglas–Rachford splitting methods for solving large-scale sparse absolute value equations
- Interval algorithm for absolute value equations
- Levenberg-Marquardt method for solving systems of absolute value equations
- On equivalent reformulations for absolute value equations
- On iterative solution for linear complementarity problem with an \(H_{+}\)-matrix
- On the SOR-like iteration method for solving absolute value equations
- Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes
- Revisiting convergence analysis of two-step iterative methods in the Kellogg-type iteration framework
- Solving absolute value equation using complementarity and smoothing functions
- SOR-like iteration method for solving absolute value equations
- The Linear Complementarity Problem
- The new iteration algorithm for absolute value equation
- The Picard-HSS iteration method for absolute value equations
This page was built for publication: A new class of fixed point methods for solving absolute value equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299991)