On the public citation graph
Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
0 signed · 25 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01268170openalex-snapshot
Solution of symmetric linear complementarity problems by iterative methods
inferredcites →https://doi.org/10.1007/bf01589410openalex-snapshot
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
inferredcites →https://doi.org/10.1016/0024-3795(68)90052-9openalex-snapshot
Complementary pivot theory of mathematical programming
inferredcites →https://doi.org/10.1145/322063.322067openalex-snapshot
Asynchronous Iterative Methods for Multiprocessors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4330050802openalex-snapshot
Massively parallel solution of quadratic programs via successive overrelaxation
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_12openalex-snapshot
Optimization Methods in Massive Data Sets
inferred← citeshttps://doi.org/10.1007/978-1-4757-3279-5_11openalex-snapshot
Data Discrimination via Nonlinear Generalized Support Vector Machines
inferred← citeshttps://doi.org/10.1007/978-1-4757-3279-5_14openalex-snapshot
A Class of Globally Convergent Algorithms for Pseudomonotone Variational Inequalities
inferred← citeshttps://doi.org/10.1007/bf00940641openalex-snapshot
Partially and totally asynchronous algorithms for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf01581703openalex-snapshot
A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf02072643openalex-snapshot
Parallel computation of intertemporal multicommodity spatial price equilibria in the presence of quotas
inferred← citeshttps://doi.org/10.1007/s10092-019-0337-0openalex-snapshot
On the equivalence between some projected and modulus-based splitting methods for linear complementarity problems
inferred← citeshttps://doi.org/10.1109/72.788643openalex-snapshot
Successive overrelaxation for support vector machines
inferred← citeshttps://doi.org/10.1109/cmpsac.1990.139352openalex-snapshot
Application-level software self-balancing
inferred← citeshttps://doi.org/10.1109/csf.2008.25openalex-snapshot
Security Decision-Making among Interdependent Organizations
inferred← citeshttps://doi.org/10.1109/tccn.2018.2856207openalex-snapshot
Collaborative IDS Configuration: A Two-Layer Game-Theoretic Approach
inferred← citeshttps://doi.org/10.1145/195470.195501openalex-snapshot
Where is time spent in message-passing and shared-memory programs?
inferred← citeshttps://doi.org/10.1145/195473.195501openalex-snapshot
Where is time spent in message-passing and shared-memory programs?
inferred← citeshttps://doi.org/10.1145/381792.195501openalex-snapshot
Where is time spent in message-passing and shared-memory programs?
inferred← citeshttps://doi.org/10.1287/trsc.26.1.48openalex-snapshot
Parallel and Serial Successive Overrelaxation for Multicommodity Spatial Price Equilibrium Problems
inferred← citeshttps://doi.org/10.4018/978-1-4666-9644-0.ch021openalex-snapshot
Verification of Iterative Methods for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.5687/iscie.10.248openalex-snapshot
An Asynchronous Block-Parallel Algorithm for Separable Quadratic Programming Problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.