On the public citation graph

A Variational Approach To The Linear Complementarity Problem.

https://doi.org/10.7302/21411
0 signed · 12 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4613-3572-6_10openalex-snapshot
Linear Complementarity and the Degree of Mappings
inferred← citeshttps://doi.org/10.1007/978-1-4613-3572-6_7openalex-snapshot
Relations Between PL Maps, Complementary Cones, and Degree in Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/bf01582265openalex-snapshot
CP-rays in simplicial cones
inferred← citeshttps://doi.org/10.1007/bf01583787openalex-snapshot
Some perturbation results for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1007/bf01587097openalex-snapshot
An example of a nonregular semimonotoneQ-matrix
inferred← citeshttps://doi.org/10.1007/bf01589438openalex-snapshot
A finite characterization ofK-matrices in dimensions less than four
inferred← citeshttps://doi.org/10.1007/bf02591739openalex-snapshot
Robustness and nondegenerateness for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02591954openalex-snapshot
Stability of the linear complementarity problem at a solution point
inferred← citeshttps://doi.org/10.1007/s10107-025-02252-xopenalex-snapshot
On covering Euclidean space with Q-arrangements of cones
inferred← citeshttps://doi.org/10.1016/b978-0-12-398050-2.50020-7openalex-snapshot
Computational Experience With Large-Scale Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1080/00207167808803148openalex-snapshot
An algorithm for the linear complementarity problem
inferred← citeshttps://doi.org/10.1080/00207168608803522openalex-snapshot
Iterative algorithms 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.