On the public citation graph

Basic-set algorithm for a generalized linear complementarity problem

https://doi.org/10.1007/bf00940317
0 signed · 38 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/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
inferredcites →https://doi.org/10.1002/nav.3800310408openalex-snapshot
Application of disjunctive programming to the linear complementarity problem
inferredcites →https://doi.org/10.1002/nme.1620210106openalex-snapshot
Sparse matrix factor modification in structural reanalysis
inferredcites →https://doi.org/10.1002/zamm.19790590235openalex-snapshot
Forsythe, G. E. / Malcolm, M. A. / Moler, C. B., Computer Methods for Mathematical Computations. Englewood Cliffs, New Jersey 07632. Prentice Hall, Inc., 1977. XI, 259 S
inferredcites →https://doi.org/10.1007/bf01436076openalex-snapshot
Triangular factors of modified matrices
inferredcites →https://doi.org/10.1007/bf01442196openalex-snapshot
An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
inferredcites →https://doi.org/10.1007/bf01582097openalex-snapshot
On a class of least-element complementarity problems
inferredcites →https://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
inferredcites →https://doi.org/10.1007/bf01586934openalex-snapshot
A class of methods for solving large, convex quadratic programs subject to box constraints
inferredcites →https://doi.org/10.1007/bf01589334openalex-snapshot
A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
inferredcites →https://doi.org/10.1007/bf02591868openalex-snapshot
Iterative methods for linear complementarity problems with upperbounds on primary variables
inferredcites →https://doi.org/10.1016/0024-3795(74)90066-4openalex-snapshot
Manifestations of the Schur complement
inferredcites →https://doi.org/10.1016/0045-7949(82)90082-7openalex-snapshot
Contact problems for the elastic beam
inferredcites →https://doi.org/10.1016/0191-2607(88)90015-5openalex-snapshot
Predicting intercity freight flows
inferredcites →https://doi.org/10.1016/0377-2217(89)90500-6openalex-snapshot
Linear complementarity, linear and nonlinear programming
inferredcites →https://doi.org/10.1016/b978-0-12-468660-1.50018-9openalex-snapshot
A SPECIAL CLASS OF LARGE QUADRATIC PROGRAMS11This research was supported by Air Force Office of Scientific Research Contract F44620-74-C-0079.
inferredcites →https://doi.org/10.1090/s0002-9939-1969-0255573-1openalex-snapshot
An Identity for the Schur Complement of a Matrix
inferredcites →https://doi.org/10.1093/imaman/2.1.51openalex-snapshot
Bard-type Methods for the Linear Complementarity problem with symmetric positive Definite Matrices
inferredcites →https://doi.org/10.1109/proc.1982.12322openalex-snapshot
Computer solution of large positive definite systems
inferredcites →https://doi.org/10.1111/j.1469-8137.1975.tb01405.xopenalex-snapshot
I. NUMERICAL ANALYSIS
inferredcites →https://doi.org/10.1137/0905043openalex-snapshot
Direct Methods for Solving Sparse Systems of Linear Equations
inferredcites →https://doi.org/10.1137/1.9781611975604openalex-snapshot
Practical Optimization
inferredcites →https://doi.org/10.1145/357456.2181openalex-snapshot
Minkowski matrices.
inferredcites →https://doi.org/10.1145/357456.357459openalex-snapshot
The efficient solution of linear complementarity problems for tridiagonal Minkowski matrices
inferredcites →https://doi.org/10.1287/opre.28.3.754openalex-snapshot
A New and Efficient Algorithm for a Class of Portfolio Selection Problems
inferredcites →https://doi.org/10.2307/1909433openalex-snapshot
Introduction to Linear Algebra

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-94-009-0369-2_15openalex-snapshot
Algorithms for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s11044-018-09656-yopenalex-snapshot
Analysis of friction coupling and the Painlevé paradox in multibody systems
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90106-6openalex-snapshot
A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.jterra.2025.101081openalex-snapshot
Efficient flexible tire-terrain interaction modelling
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00243-3openalex-snapshot
On the convergence of the block principal pivotal algorithm for the LCP
inferred← citeshttps://doi.org/10.1016/s1570-8659(96)80005-6openalex-snapshot
Numerical methods for unilateral problems in solid mechanics
inferred← citeshttps://doi.org/10.1109/lra.2020.3010204openalex-snapshot
Model-Based Coupling for Co-Simulation of Robotic Contact Tasks
inferred← citeshttps://doi.org/10.1115/1.4046052openalex-snapshot
Co-Simulation of Multibody Systems With Contact Using Reduced Interface Models
inferred← citeshttps://doi.org/10.1115/detc2016-60064openalex-snapshot
A Regularized Contact Model for Multibody System Simulation
inferred← citeshttps://doi.org/10.1115/detc2017-67988openalex-snapshot
A Friction Model for Non-Singular Complementarity Formulations for Multibody Systems With Contacts
inferred← citeshttps://doi.org/10.1137/19m1243828openalex-snapshot
An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems
inferred← citeshttps://doi.org/10.82308/14522openalex-snapshot
Contributions to contact simulation and human motion analysis
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.