On the public citation graph
Q-matrices and boundedness of solutions to linear complementarity problems
0 signed · 27 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/bf01583787openalex-snapshot
Some perturbation results for the Linear Complementarity Problem
inferredcites →https://doi.org/10.1007/bf01587097openalex-snapshot
An example of a nonregular semimonotoneQ-matrix
inferredcites →https://doi.org/10.1007/bf01588239openalex-snapshot
On the number of solutions to a class of linear complementarity problems
inferredcites →https://doi.org/10.1007/bf01696240openalex-snapshot
ИССЛЕДОВАНИЕ НЕКОТО РЫХ СЛОЖНЫХ ПОЛУПРОВОДНИКОВЫХ Т ВДРДЫХ РАСТВОРОВ И СОЕДИНЕНИЙ НА ОСНОВ Е ИНДИЯ
inferredcites →https://doi.org/10.1007/bf02591945openalex-snapshot
On the uniqueness of solutions to linear complementarity problems
inferredcites →https://doi.org/10.1007/bfb0120987openalex-snapshot
Characterizations of bounded solutions of linear complementarity problems
inferredcites →https://doi.org/10.1007/bfb0121241openalex-snapshot
Solution rays for a class of complementarity problems
inferredcites →https://doi.org/10.1007/springerreference_5340openalex-snapshot
Complementarity problems
inferredcites →https://doi.org/10.1016/0024-3795(72)90019-5openalex-snapshot
On the number of solutions to the complementarity problem and spanning properties of complementary cones
inferredcites →https://doi.org/10.1137/0123006openalex-snapshot
On the Alass of Complementary Cones and Lemke’s Algorithm
inferredcites →https://doi.org/10.1137/0131031openalex-snapshot
Some Perturbation Theorems for Q -Matrices
inferredcites →https://doi.org/10.1287/mnsc.17.9.612openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.21136/cmj.1962.100526openalex-snapshot
On matrices with non-positive off-diagonal elements and positive principal minors
inferredcites →https://doi.org/10.2307/1907816openalex-snapshot
Activity Analysis of Production and Allocation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10107-005-0639-7openalex-snapshot
Sufficient matrices belong to L
inferred← citeshttps://doi.org/10.1007/s10957-005-6554-5openalex-snapshot
Characterizing Q-Matrices beyond L-Matrices
inferred← citeshttps://doi.org/10.1007/s10957-012-0116-4openalex-snapshot
Linear Complementarity Problems over Symmetric Cones: Characterization of Q b -transformations and Existence Results
inferred← citeshttps://doi.org/10.1007/s10957-019-01566-zopenalex-snapshot
Tensor Complementarity Problems—Part I: Basic Theory
inferred← citeshttps://doi.org/10.1007/s10957-020-01631-yopenalex-snapshot
Properties of Structured Tensors and Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s11071-018-4347-2openalex-snapshot
Planar multiple-contact problems subject to unilateral and bilateral kinetic constraints with static Coulomb friction
inferred← citeshttps://doi.org/10.1016/j.ifacol.2020.12.1543openalex-snapshot
A notion of equivalence for linear complementarity problems Applications to the design of nonsmooth bifurcations
inferred← citeshttps://doi.org/10.1109/tac.2023.3338981openalex-snapshot
Equivalence of Linear Complementarity Problems: Theory and Application to Nonsmooth Bifurcations
inferred← citeshttps://doi.org/10.48550/arxiv.1608.06958openalex-snapshot
Isotone projection cones and Q-matrices
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.