On the public citation graph
The generalized linear complementarity problem and an algorithm to find all its solutions
0 signed · 51 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/978-1-4613-3572-6_6openalex-snapshot
On the Equivalence of the Linear Complementarity Problem and a System of Piecewise Linear Equations: Part II
inferredcites →https://doi.org/10.1007/bfb0121176openalex-snapshot
An implicit enumeration procedure for the general linear complementarity problem
inferredcites →https://doi.org/10.1016/0024-3795(68)90052-9openalex-snapshot
Complementary pivot theory of mathematical programming
inferredcites →https://doi.org/10.1016/0377-2217(89)90500-6openalex-snapshot
Linear complementarity, linear and nonlinear programming
inferredcites →https://doi.org/10.1016/s0021-9800(70)80010-2openalex-snapshot
A generalization of the linear complementarity problem
inferredcites →https://doi.org/10.1109/31.41295openalex-snapshot
The generalized linear complementarity problem applied to the complete analysis of resistive piecewise-linear circuits
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1109/tcs.1981.1085004openalex-snapshot
Analysis of piecewise-linear resistive networks using complementary pivot theory
inferredcites →https://doi.org/10.1137/0206036openalex-snapshot
A New Algorithm for Generating All the Maximal Independent Sets
inferredcites →https://doi.org/10.1287/mnsc.11.7.681openalex-snapshot
Bimatrix Equilibrium Points and Mathematical Programming
inferredcites →https://doi.org/10.1287/moor.5.2.167openalex-snapshot
A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
inferredcites →https://doi.org/10.1515/9781400881970-004openalex-snapshot
3. The Double Description Method
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2969/jmsj/03010023openalex-snapshot
Variational inequalities and complementarity problems
inferredcites →https://doi.org/10.6100/ir118197openalex-snapshot
Piecewise-linear modelling and analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.5281/zenodo.1088173openalex-extracted
Bi-Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1002/(sici)1097-0207(19960415)39:7<1161::aid-nme898>3.0.co;2-2openalex-snapshot
POST-BUCKLING ANALYSIS WITH FRICTIONAL CONTACTS COMBINING COMPLEMENTARITY RELATIONS AND AN ARC-LENGTH METHOD
inferred← citeshttps://doi.org/10.1002/pamm.200810799openalex-snapshot
Verification Methods for the Horizontal Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1007/0-387-24276-7_18openalex-snapshot
Linear Complementarity Since 1978
inferred← citeshttps://doi.org/10.1007/978-0-387-77247-9_21openalex-snapshot
The Extended Linear Complementarity Problem and Its Applications in Analysis and Control of Discrete-Event Systems
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-3-7091-2534-2_3openalex-snapshot
Some Notes on Friction and Instabilities
inferred← citeshttps://doi.org/10.1007/978-90-481-9577-0_11openalex-snapshot
Finite Dimensional Frictional Contact Quasi-Static Rate and Evolution Problems Revisited
inferred← citeshttps://doi.org/10.1007/978-94-011-4275-5_18openalex-snapshot
Bifurcations and Instabilities in Some Finite Dimensional Frictional Contact Problems
inferred← citeshttps://doi.org/10.1007/bf01590958openalex-snapshot
The extended linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bfb0014743openalex-snapshot
Generalized linear complementarity problems and the analysis of continuously variable systems and discrete event systems
inferred← citeshttps://doi.org/10.1007/s10589-024-00581-9openalex-snapshot
Projected fixed-point method for vertical tensor complementarity problems
inferred← citeshttps://doi.org/10.1007/s10957-024-02450-1openalex-snapshot
An Iterative Method for Horizontal Tensor Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s11075-022-01296-wopenalex-snapshot
A sign-based linear method for horizontal linear complementarity problems
inferred← citeshttps://doi.org/10.1007/s11075-023-01640-8openalex-snapshot
The nonsmooth Newton’s method for the horizontal nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00147-6openalex-snapshot
Reducing horizontal linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.automatica.2015.09.019openalex-snapshot
Enumeration-based approach to solving parametric linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2021.113913openalex-snapshot
A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix
inferred← citeshttps://doi.org/10.1016/j.cma.2009.12.008openalex-snapshot
Enumeration of all wedged equilibrium configurations in contact problem with Coulomb friction
inferred← citeshttps://doi.org/10.1016/j.cma.2010.12.019openalex-snapshot
Assessing the complete solution set of the planar frictional wedging problem
inferred← citeshttps://doi.org/10.1016/j.compstruc.2004.03.044openalex-snapshot
A numerical study on multiple rate solutions and onset of directional instability in quasi-static frictional contact problems
inferred← citeshttps://doi.org/10.1016/j.euromechsol.2020.104062openalex-snapshot
Existence and multiplicity of solutions in frictional contact mechanics. Part I: A simplified criterion
inferred← citeshttps://doi.org/10.1016/s0045-7825(02)00645-xopenalex-snapshot
Efficient computation of multiple solutions in quasibrittle fracture analysis
inferred← citeshttps://doi.org/10.1016/s0045-7825(03)00256-1openalex-snapshot
The evolution and rate problems and the computation of all possible evolutions in quasi-static frictional contact
inferred← citeshttps://doi.org/10.1016/s0167-6377(02)00159-1openalex-snapshot
On the equivalence of linear complementarity problems
inferred← citeshttps://doi.org/10.1016/s0167-6911(97)00136-9openalex-snapshot
The Linear Dynamic Complementarity Problem is a special case of the Extended Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1080/0020717021000049188openalex-snapshot
MPC for discrete-event systems with soft and hard synchronization constraints
inferred← citeshttps://doi.org/10.1109/81.989165openalex-snapshot
On the dynamic analysis of piecewise-linear networks
inferred← citeshttps://doi.org/10.1109/9.664151openalex-snapshot
Complementarity modeling of hybrid systems
inferred← citeshttps://doi.org/10.1109/acc.2011.5991294openalex-snapshot
Computation of limit cycles in Lur'e systems
inferred← citeshttps://doi.org/10.1109/ecctd.2017.8093298openalex-snapshot
Complete Analysis of Piecewise-Linear Resistive Circuits using Integer Programming
inferred← citeshttps://doi.org/10.5802/crmeca.362openalex-snapshot
On the influence of resolution algorithm’s parameters on the converged solution for a Coulomb friction contact problem exhibiting multiple solutions
inferred← citeshttps://doi.org/10.6100/ir527574openalex-snapshot
Linear complementarity systems : a study in hybrid dynamics
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.