On the public citation graph
On the convergence of iterative methods for symmetric linear complementarity problems
0 signed · 28 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/bf00934130openalex-snapshot
Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
inferredcites →https://doi.org/10.1007/bf00934893openalex-snapshot
Maximal points with respect to cone dominance in Banach spaces and their existence
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/bf01268170openalex-snapshot
Solution of symmetric linear complementarity problems by iterative methods
inferredcites →https://doi.org/10.1007/bf01581641openalex-snapshot
Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
inferredcites →https://doi.org/10.1007/bfb0120929openalex-snapshot
Some continuity properties of polyhedral multifunctions
inferredcites →https://doi.org/10.1016/0377-2217(89)90500-6openalex-snapshot
Linear complementarity, linear and nonlinear programming
inferredcites →https://doi.org/10.1137/0801009openalex-snapshot
Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1287/mnsc.17.9.612openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1287/moor.18.2.317openalex-snapshot
Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems
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/bf00992845openalex-snapshot
An interior point multiplicative method for optimization under positivity constraints
inferred← citeshttps://doi.org/10.1007/bf01581264openalex-snapshot
Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
inferred← citeshttps://doi.org/10.1007/bf02677381openalex-snapshot
A splitting method for quadratic programming problem
inferred← citeshttps://doi.org/10.1007/s11590-011-0292-4openalex-snapshot
SOR- and Jacobi-type iterative methods for solving ℓ 1 − ℓ 2 problems by way of Fenchel duality
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00093-gopenalex-snapshot
A parallel relaxation method for quadratic programming problems with interval constraints
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00103-2openalex-snapshot
A multisplitting method for symmetric linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.amc.2014.06.038openalex-snapshot
Improved convergence theorems of multisplitting methods for the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.amc.2015.08.100openalex-snapshot
Overlapping restricted additive Schwarz method with damping factor for H-matrix linear complementarity problem
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.camwa.2009.07.081openalex-snapshot
A multiplicative multisplitting method for solving the linear complementarity problem
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/00207169408804240openalex-snapshot
Accelerating iterative algorithms for symmetric linear complementarity problems
inferred← citeshttps://doi.org/10.1137/060658576openalex-snapshot
Solution Continuity in Monotone Affine Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s0895479897324032openalex-snapshot
On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.15807/jorsj.39.407openalex-snapshot
A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
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.