An inexact fixed point iteration method for solving absolute value equation
From MaRDI portal
Publication:6498444
DOI10.1007/S13160-023-00641-3MaRDI QIDQ6498444
Publication date: 7 May 2024
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Numerical optimization and variational techniques (65K10) Linear programming (90C05) Iterative numerical methods for linear systems (65F10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side
- The Picard-HSS iteration method for absolute value equations
- Absolute value programming
- Modulus-based matrix splitting algorithms for the quasi-complementarity problems
- The unique solution of the absolute value equations
- SOR-like iteration method for solving absolute value equations
- On an iterative method for solving absolute value equations
- Two new fixed point iterative schemes for absolute value equations
- On the SOR-like iteration method for solving absolute value equations
- The new iteration algorithm for absolute value equation
- Modified Newton-type iteration methods for generalized absolute value equations
- Absolute value equation solution via concave minimization
- Some notes on the solvability conditions for absolute value equations
- A theorem of the alternatives for the equationAx+B|x| =b
- A modified fixed point iteration method for solving the system of absolute value equations
- A New Uzawa-Type Iteration Method for Non-Hermitian Saddle-Point Problems
- Shift-splitting fixed point iteration method for solving generalized absolute value equations
This page was built for publication: An inexact fixed point iteration method for solving absolute value equation