On the public citation graph
On the uniqueness of solutions to linear complementarity problems
0 signed · 53 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/bf01292722openalex-snapshot
Elementare Theorie der konvexen Polyeder
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/bf01584349openalex-snapshot
A note on an open problem in linear complementarity
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.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/b978-0-12-597050-1.50016-6openalex-snapshot
Recent Results on Complementarity Problems
inferredcites →https://doi.org/10.1090/procopenalex-snapshot
Proceedings of the American Mathematical Society
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.1137/0123005openalex-snapshot
A Characterization of the Constant Parity Property of the Number of Solutions to the Linear Complementarity Problem
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/moor.7.2.272openalex-snapshot
A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem
inferredcites →https://doi.org/10.1515/9781400869930openalex-snapshot
Proceedings of the Princeton Symposium on Mathematical Programming
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-0-387-77439-8_8openalex-snapshot
Harry Markowitz and the Early History of Quadratic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4612-1336-9_16openalex-snapshot
The Linear Complementarity Problem in Static and Dynamic Games
inferred← citeshttps://doi.org/10.1007/978-1-4757-2640-4_13openalex-snapshot
A Chain Condition for Qo-Matrices
inferred← citeshttps://doi.org/10.1007/978-1-4757-3279-5_8openalex-snapshot
On the Connectedness of Solution Sets of Parametrized Equations and of Solution Sets in Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-29959-9_7openalex-snapshot
On Semimonotone Z-Matrices
inferred← citeshttps://doi.org/10.1007/978-981-97-8907-8_7openalex-snapshot
Complementarity Problems and Its Relation with Optimization Theory
inferred← citeshttps://doi.org/10.1007/bf01581265openalex-snapshot
The basic theorem of complementarity revisited
inferred← citeshttps://doi.org/10.1007/bf01582231openalex-snapshot
Linear complementarity problems with an invariant number of solutions
inferred← citeshttps://doi.org/10.1007/bf01587097openalex-snapshot
An example of a nonregular semimonotoneQ-matrix
inferred← citeshttps://doi.org/10.1007/bf02096262openalex-snapshot
Degeneracy in linear complementarity problems: a survey
inferred← citeshttps://doi.org/10.1007/bf02190060openalex-snapshot
Q-matrices and boundedness of solutions to linear complementarity problems
inferred← citeshttps://doi.org/10.1007/s00180-020-01003-0openalex-snapshot
KLERC: kernel Lagrangian expectile regression calculator
inferred← citeshttps://doi.org/10.1007/s10107-016-0996-4openalex-snapshot
Some LCPs solvable in strongly polynomial time with Lemke’s algorithm
inferred← citeshttps://doi.org/10.1007/s10479-014-1622-6openalex-snapshot
Properties of some matrix classes based on principal pivot transform
inferred← citeshttps://doi.org/10.1007/s10898-009-9441-zopenalex-snapshot
A field guide to the matrix classes found in the literature of the linear complementarity problem
inferred← citeshttps://doi.org/10.1007/s10957-012-0075-9openalex-snapshot
Local Uniqueness of Solutions to Ky Fan Vector Inequalities using Approximations as Derivatives
inferred← citeshttps://doi.org/10.1007/s13042-018-0796-7openalex-snapshot
A fast iterative algorithm for support vector data description
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90170-4openalex-snapshot
The linear complementarity problem and a subclass of fully semimonotone matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(88)90061-4openalex-snapshot
Structure properties of W matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90410-copenalex-snapshot
Two characterizations of sufficient matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00058-1openalex-snapshot
Criteria for sufficient matrices
inferred← citeshttps://doi.org/10.1016/0140-9883(85)90002-7openalex-snapshot
A sensitivity analysis of the linear complementarity programming model
inferred← citeshttps://doi.org/10.1016/j.laa.2004.11.023openalex-snapshot
Principal pivot transforms of some classes of matrices
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00247-0openalex-snapshot
On the classes of fully copositive and fully semimonotone matrices
inferred← citeshttps://doi.org/10.1137/s0895479893253604openalex-snapshot
Some Properties of Fully Semimonotone, $Q_0 $-Matrices
inferred← citeshttps://doi.org/10.1137/s0895479897329898openalex-snapshot
A Note on P 1 - and Lipschitzian Matrices
inferred← citeshttps://doi.org/10.1137/s0895479899363526openalex-snapshot
Principal Pivoting Method for Solving Column Sufficient Complementarity Problems
inferred← citeshttps://doi.org/10.1142/s0219198913400367openalex-snapshot
ON FULLY SEMIMONOTONE MATRICES
inferred← citeshttps://doi.org/10.1287/moor.15.2.243openalex-snapshot
On Some Classes of Linear Complementarity Problems with Matrices of Order n and Rank (n − 1)
inferred← citeshttps://doi.org/10.1287/moor.17.1.77openalex-snapshot
On Solution Stability of the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.21236/ada230319openalex-snapshot
Two Characterizations of Sufficient Matrices
inferred← citeshttps://doi.org/10.2172/6427424openalex-snapshot
Two characterizations of sufficient matrices
inferred← citeshttps://doi.org/10.7153/oam-2021-15-68openalex-snapshot
On semimonotone star matrices and 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.