On the public citation graph

On Minkowski matrices and the linear complementarity problem

https://doi.org/10.1007/bfb0079164
0 signed · 18 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1971.tb02619.xopenalex-snapshot
Heavy Traffic Characteristics of a Circular Data Network
inferredcites →https://doi.org/10.1002/nme.1620040302openalex-snapshot
Mathematical programming methods for the inelastic analysis of reinforced concrete frames allowing for limited rotation capacity
inferredcites →https://doi.org/10.1002/zamm.19620421312openalex-snapshot
Ein Verfahren zur Maximierung linearer Funktionen in nichtkonvexen Bereichen
inferredcites →https://doi.org/10.1007/bf01584990openalex-snapshot
Monotone solutions of the parametric linear complementarity problem
inferredcites →https://doi.org/10.1007/bf01584992openalex-snapshot
Polyhedral sets having a least element
inferredcites →https://doi.org/10.1137/0316004openalex-snapshot
A Maximization Problem Related to Parametric Linear Complementarity

What points at this work

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

inferred← citeshttps://doi.org/10.1002/1520-6750(199004)37:2<279::aid-nav3220370207>3.0.co;2-vopenalex-snapshot
A bard-type method for a generalized linear complementarity problem with a nonsingular m-matrix
inferred← citeshttps://doi.org/10.1002/nme.1620110709openalex-snapshot
A mathematical programming method for the inelastic analysis of reinforced concrete frames
inferred← citeshttps://doi.org/10.1002/nme.1620140506openalex-snapshot
Matrix‐MP method for the analysis of inelastic arch structures
inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_3openalex-snapshot
Complementarity Problems as Mathematical Models
inferred← citeshttps://doi.org/10.1007/bf01593768openalex-snapshot
Isotone solutions of parametric linear complementarity problems
inferred← citeshttps://doi.org/10.1016/0024-3795(76)90030-6openalex-snapshot
M-matrices leading to semiconvergent splittings
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90045-9openalex-snapshot
Linear complementarity problems and characterizations of Minkowski matrices
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(81)90091-4openalex-snapshot
LU decomposition of M-matrices by elimination without pivoting
inferred← citeshttps://doi.org/10.1016/0141-0296(88)90001-6openalex-snapshot
Boundary element analysis by linearized nonlinear elastic material models: an application to no-tension systems
inferred← citeshttps://doi.org/10.1137/0316004openalex-snapshot
A Maximization Problem Related to Parametric Linear Complementarity
inferred← citeshttps://doi.org/10.1287/moor.18.2.275openalex-snapshot
Least Controls for a Class of Constrained Linear Stochastic Systems
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.