On the public citation graph

Two-stage parallel iterative methods for the symmetric linear complementarity problem

https://doi.org/10.1007/bf02186474
0 signed · 26 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00934130openalex-snapshot
Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
inferredcites →https://doi.org/10.1007/bf00934765openalex-snapshot
On the convergence of a basic iterative method for the implicit complementarity problem
inferredcites →https://doi.org/10.1007/bf00935004openalex-snapshot
On the gradient-projection method for solving the nonsymmetric linear complementarity problem
inferredcites →https://doi.org/10.1007/bf00939250openalex-snapshot
More results on the convergence of iterative methods for the symmetric linear complementarity problem
inferredcites →https://doi.org/10.1007/bf00940194openalex-snapshot
Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
inferredcites →https://doi.org/10.1007/bf01268170openalex-snapshot
Solution of symmetric linear complementarity problems by iterative methods
inferredcites →https://doi.org/10.1007/bf02186473openalex-snapshot
Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
inferredcites →https://doi.org/10.1007/bf02591989openalex-snapshot
Inexact Newton methods for the nonlinear complementarity problem
inferredcites →https://doi.org/10.1016/0024-3795(69)90029-9openalex-snapshot
Blocs-H-matrices et convergence des methodes iteratives classiques par blocs
inferredcites →https://doi.org/10.1016/0167-8191(85)90024-9openalex-snapshot
MIMD computing in the USA—1984
inferredcites →https://doi.org/10.1137/0325023openalex-snapshot
Iterative Methods for Large Convex Quadratic Programs: A Survey
inferredcites →https://doi.org/10.1137/0606062openalex-snapshot
Multi-Splittings of Matrices and Parallel Solution of Linear Systems
inferredcites →https://doi.org/10.1137/0719025openalex-snapshot
Inexact Newton Methods
inferredcites →https://doi.org/10.1184/r1/6610166openalex-snapshot
Synchronized and asynchronous parallel algorithms for multiprocessors
inferredcites →https://doi.org/10.1287/mnsc.17.11.698openalex-snapshot
On Quadratic Programming
inferredcites →https://doi.org/10.1287/opre.34.5.667openalex-snapshot
Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf00247654openalex-snapshot
An inexact NE/SQP method for solving the nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf01589414openalex-snapshot
Parallel Newton methods for the nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf01589416openalex-snapshot
Vectorization and multitasking of nonlinear network programming algorithms
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1007/s11075-009-9338-4openalex-snapshot
Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems
inferred← citeshttps://doi.org/10.1016/0305-0548(91)90090-eopenalex-snapshot
Parallel processing and OR/MS
inferred← citeshttps://doi.org/10.1016/j.cam.2008.02.013openalex-snapshot
Inexact multisplitting methods for linear complementarity problems
inferred← citeshttps://doi.org/10.1080/07421222.1989.11517865openalex-snapshot
The Impact of Parallel and Neural Computing on Managerial Decision Making
inferred← citeshttps://doi.org/10.1137/0801009openalex-snapshot
Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0803008openalex-snapshot
Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
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.