On the public citation graph
A linear complementarity problem with an n by 2n “P”-matrix
0 signed · 34 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.1002/nme.1620110709openalex-snapshot
A mathematical programming method for the inelastic analysis of reinforced concrete frames
inferredcites →https://doi.org/10.1007/bf01582097openalex-snapshot
On a class of least-element complementarity problems
inferredcites →https://doi.org/10.1007/bf02166034openalex-snapshot
Some generalizations of positive definiteness and monotonicity
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.1016/s0021-9800(70)80010-2openalex-snapshot
A generalization of the linear complementarity problem
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0097025-0openalex-snapshot
A partition theorem for Euclidean 𝑛-space
inferredcites →https://doi.org/10.1112/plms/s3-16.1.519openalex-snapshot
A Probelm in Linear Inequalities
inferredcites →https://doi.org/10.1287/mnsc.11.7.681openalex-snapshot
Bimatrix Equilibrium Points and Mathematical Programming
inferredcites →https://doi.org/10.1287/mnsc.17.9.612openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1287/opre.15.3.482openalex-snapshot
A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
inferredcites →https://doi.org/10.2307/2033091openalex-snapshot
A Partition Theorem for Euclidean n-Space
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.1620210412openalex-snapshot
INACOF—A computer program for the inelastic analysis of reinforced concrete framed structures
inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_2openalex-snapshot
Complementarity Problems. Origins and Definitions
inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_3openalex-snapshot
Complementarity Problems as Mathematical Models
inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_6openalex-snapshot
Topological Degree and Complementarity
inferred← citeshttps://doi.org/10.1007/978-981-13-3059-9_1openalex-snapshot
A Unified Framework for a Class of Mathematical Programming Problems
inferred← citeshttps://doi.org/10.1007/978-981-16-4737-6_2openalex-snapshot
Linear Games and Complementarity Problems
inferred← citeshttps://doi.org/10.1007/bf01582097openalex-snapshot
On a class of least-element complementarity problems
inferred← citeshttps://doi.org/10.1007/bf01582119openalex-snapshot
On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
inferred← citeshttps://doi.org/10.1007/bf01589334openalex-snapshot
A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
inferred← citeshttps://doi.org/10.1016/0024-3795(79)90103-4openalex-snapshot
Hidden Z-matrices with positive principal minors
inferred← citeshttps://doi.org/10.1016/0024-3795(80)90170-6openalex-snapshot
Some n by dn linear complementarity problems
inferred← citeshttps://doi.org/10.1016/0024-3795(81)90156-7openalex-snapshot
Matrices and the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00184-2openalex-snapshot
Generalizations of P0- and P-properties; extended vertical and horizontal linear complementarity problems
inferred← citeshttps://doi.org/10.1016/0045-7949(80)90169-8openalex-snapshot
CONFAP—a computer program for inelastic analysis of reinforced concrete framed structures
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90256-9openalex-snapshot
On some classes of matrices related to solving linear complementarity problems as linear programs
inferred← citeshttps://doi.org/10.1016/j.laa.2011.10.034openalex-snapshot
On “P” property and the column-W property
inferred← citeshttps://doi.org/10.1016/j.laa.2021.03.016openalex-snapshot
A generalization of irreducibility and diagonal dominance with applications to horizontal and vertical linear complementarity problems
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00593-6openalex-snapshot
Existence and uniqueness of solutions for a class of piecewise linear dynamical systems
inferred← citeshttps://doi.org/10.1137/0614069openalex-snapshot
Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
inferred← citeshttps://doi.org/10.1287/opre.28.3.754openalex-snapshot
A New and Efficient Algorithm for a Class of Portfolio Selection Problems
inferred← citeshttps://doi.org/10.1287/opre.28.4.927openalex-snapshot
A Parametric Linear Complementarity Technique for Optimal Portfolio Selection with a Risk-Free Asset
inferred← citeshttps://doi.org/10.21136/am.2020.0371-19openalex-snapshot
Linear complementarity problems and bi-linear games
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.