scientific article; zbMATH DE number 7468995
From MaRDI portal
Publication:5027113
DOI10.30495/JME.2021.1393zbMath1478.65018MaRDI QIDQ5027113
No author found.
Publication date: 3 February 2022
Full work available at URL: https://www.ijmex.com/index.php/ijmex/article/view/1393
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Iterative numerical methods for linear systems (65F10)
Related Items (2)
Two new iteration methods with optimal parameters for solving absolute value equations ⋮ The solution of a type of absolute value equations using two new matrix splitting iterative techniques
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Residual iterative method for solving absolute value equations
- The Picard-HSS iteration method for absolute value equations
- A generalized Newton method for absolute value equations associated with second order cones
- A globally and quadratically convergent method for absolute value equations
- Some techniques for solving absolute value equations
- On unique solvability of the absolute value equation
- Absolute value equations
- Absolute value programming
- Note to the mixed-type splitting iterative method for \(Z\)-matrices linear systems
- A generalized Newton method for absolute value equations
- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- Global and finite convergence of a generalized Newton method for absolute value equations
- A generalization of the Gauss-Seidel iteration method for solving absolute value equations
- On an iterative method for solving absolute value equations
- Minimum norm solution to the absolute value equation in the convex case
- A special shift splitting iteration method for absolute value equation
- On the SOR-like iteration method for solving absolute value equations
- On the modified iterative methods for \(M\)-matrix linear systems
- An iterative method for solving absolute value equations and sufficient conditions for unique solvability
- Absolute value equation solution via concave minimization
- Complementary pivot theory of mathematical programming
- On equivalent reformulations for absolute value equations
- An iterative method for the positive real linear system
- Preconditioned generalized mixed-type splitting iterative method for solving weighted least-squares problems
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- Accelerated Overrelaxation Method
- A Preconditioned AOR Iterative Method for the Absolute Value Equations
- A theorem of the alternatives for the equationAx+B|x| =b
- Note To The Mixed-Type Splitting Iterative Method For The Positive Real Linear System
- Nonlinear Programming
- A generalization of the linear complementarity problem
This page was built for publication: