Abstract
We study symmetric successive overrelaxation (SSOR) method for absolute complementarity problems. Solving this problem is equivalent to solving the absolute value equations. Some examples are given to show the implementation and efficiency of the method.
Highlights
Absolute complementarity problem seeks real vectors x ≥ 0 and Ax − |x| − b ≥ 0, such that⟨x, Ax − |x| − b⟩ = 0, (1)where A ∈ Rn×n and b ∈ Rn
We study symmetric successive overrelaxation (SSOR) method for absolute complementarity problems
We suggest and analyze SSOR [5] method for absolute complementarity problem which was introduced by Noor et al [10]
Summary
Absolute complementarity problem seeks real vectors x ≥ 0 and Ax − |x| − b ≥ 0, such that. We suggest and analyze SSOR [5] method for absolute complementarity problem which was introduced by Noor et al [10]. We show that the absolute complementarity problems are equivalent to variational inequalities. For a given matrix A ∈ Rn×n, a vector b ∈ Rn, we consider the problem of finding x ∈ K∗, such that x ∈ K∗, Ax − |x| − b ∈ K∗, (2). Let K be a closed and convex set in the inner product space Rn. We consider the problem of finding x ∈ K such that. To propose and analyze algorithms for absolute complementarity problems, we need the following definitions.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
