On the public citation graph
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
0 signed · 37 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/978-3-642-46631-1_11openalex-snapshot
Serial and Parallel Solution of Large Scale Linear Programs by Augmented Lagrangian Successive Overrelaxation
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/bf00935545openalex-snapshot
Solution of nonsymmetric linear complementarity problems by iterative methods
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.1016/0305-0548(69)90004-5openalex-snapshot
Sparsity-preserving sor algorithms for separable quadratic and linear programming
inferredcites →https://doi.org/10.1109/tse.1987.233513openalex-snapshot
The Crystal Multicomputer: Design and Implementation Experience
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/0-306-48332-7_479openalex-snapshot
Splitting Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_630openalex-snapshot
Splitting Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/bf00248264openalex-snapshot
Asynchronous gradient algorithms for a class of convex separable network flow 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/bf02023047openalex-snapshot
Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf02142746openalex-snapshot
A note on the implementation of the successive overrelaxation method for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02192243openalex-snapshot
Alternating direction splitting for block Angular parallel optimization
inferred← citeshttps://doi.org/10.1007/s10255-006-0351-2openalex-snapshot
Multisplitting Iteration Schemes for Solving a Class of Nonlinear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10957-016-0944-8openalex-snapshot
Synchronous and Asynchronous Multisplitting Iteration Schemes for Solving Mixed Linear Complementarity Problems with H-Matrices
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90094-2openalex-snapshot
Asynchronous implementation of relaxation and gradient algorithms for convex network flow problems
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90047-qopenalex-snapshot
The weakest memory-access order
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00169-1openalex-snapshot
A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2004.05.018openalex-snapshot
A matrix-splitting method for symmetric affine second-order cone complementarity problems
inferred← citeshttps://doi.org/10.1016/j.trc.2024.104843openalex-snapshot
A novel framework of the alternating direction method of multipliers with application to traffic assignment problem
inferred← citeshttps://doi.org/10.1016/j.tre.2023.103111openalex-snapshot
A novel flow update policy in solving traffic assignment problems: Successive over relaxation iteration method
inferred← citeshttps://doi.org/10.1051/ro/2013027openalex-snapshot
Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems
inferred← citeshttps://doi.org/10.1080/00207160211927openalex-snapshot
Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
inferred← citeshttps://doi.org/10.1080/00207169708804568openalex-snapshot
Splitting methods for quadratic optimization in data analysis
inferred← citeshttps://doi.org/10.1080/00207169708804569openalex-snapshot
Matrix multisplitting relaxation methods for linear complementarity problems
inferred← citeshttps://doi.org/10.1080/10637199708915590openalex-snapshot
A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
inferred← citeshttps://doi.org/10.1109/71.242161openalex-snapshot
A unified formalization of four shared-memory models
inferred← citeshttps://doi.org/10.1109/cdc.1992.371154openalex-snapshot
Distributed asynchronous gradient algorithms for convex network flow problems
inferred← citeshttps://doi.org/10.1109/isca.1990.134502openalex-snapshot
Weak ordering-a new definition
inferred← citeshttps://doi.org/10.15807/jorsj.39.407openalex-snapshot
A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
inferred← citeshttps://doi.org/10.4018/978-1-4666-9644-0.ch021openalex-snapshot
Verification of Iterative Methods for the 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.