New relaxation modulus-based iterative method for large and sparse implicit complementarity problem
From MaRDI portal
Cites work
- \(H\)-splittings and two-stage iterative methods
- A modified modulus-based matrix splitting iteration method for solving implicit complementarity problems
- A monotone semismooth Newton type method for a class of complementarity problems
- A two-step iterative method based on diagonal and off-diagonal splitting for solving linear systems
- An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems
- An iterative method for solving absolute value equations and sufficient conditions for unique solvability
- Complementarity problems
- Description of all solutions of a linear complementarity problem
- Double parameter splitting (DPS) iteration method for solving complex symmetric linear systems
- Fixed point approach for complementarity problems
- General fixed-point method for solving the linear complementarity problem
- Generalized principal pivot transforms, complementarity theory and their applications in stochastic games
- scientific article; zbMATH DE number 3848999 (Why is no real title available?)
- scientific article; zbMATH DE number 3856287 (Why is no real title available?)
- scientific article; zbMATH DE number 3747003 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3539962 (Why is no real title available?)
- scientific article; zbMATH DE number 3541558 (Why is no real title available?)
- scientific article; zbMATH DE number 3419849 (Why is no real title available?)
- Improved inexact alternating direction methods for a class of nonlinear complementarity problems
- Inexact semismooth Newton methods for large-scale complementarity problems
- Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation
- Modified relaxation two-sweep modulus-based matrix splitting iteration method for solving a class of implicit complementarity problems
- Modulus-based matrix splitting iteration methods for a class of implicit complementarity problems.
- Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem
- On unique solvability of the absolute value equation
- Properties of some matrix classes based on principal pivot transform
- Some recent advances in projection-type methods for variational inequalities
- The Generalized Quasi-Variational Inequality Problem
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
- Two-step modulus-based matrix splitting iteration methods for a class of implicit complementarity problems
This page was built for publication: New relaxation modulus-based iterative method for large and sparse implicit complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7250111)