Two maximum-based fixed-point methods for the generalized absolute value equation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1953446 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- A branch-and-bound method for absolute value programs
- A class of maximum-based iteration methods for the generalized absolute value equation
- A dimension expanded Newton-type method for absolute value equations
- A generalized Newton method for absolute value equations
- A globally and quadratically convergent method for absolute value equations
- A modified Newton-based matrix splitting iteration method for generalized absolute value equations
- Absolute value equation solution via linear programming
- Exploring two new iterative methods for solving absolute value equations
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- Modified Newton-type iteration methods for generalized absolute value equations
- Newton-based matrix splitting method for generalized absolute value equation
- On the SOR-like iteration method for solving absolute value equations
- Primal-dual bilinear programming solution of the absolute value equation
- SOR-like iteration method for solving absolute value equations
- Solution of symmetric linear complementarity problems by iterative methods
- The Picard-HSS iteration method for absolute value equations
- Two new fixed point iterative schemes for absolute value equations
- Two new iteration methods with optimal parameters for solving absolute value equations
Cited in
(1)
This page was built for publication: Two maximum-based fixed-point methods for the generalized absolute value equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942547)