On the public citation graph
On a class of least-element complementarity problems
0 signed · 49 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/bf01580671openalex-snapshot
Linear complementarity problems solvable by A single linear program
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.1007/bf01593768openalex-snapshot
Isotone solutions of parametric linear complementarity problems
inferredcites →https://doi.org/10.1007/bf01696240openalex-snapshot
ИССЛЕДОВАНИЕ НЕКОТО РЫХ СЛОЖНЫХ ПОЛУПРОВОДНИКОВЫХ Т ВДРДЫХ РАСТВОРОВ И СОЕДИНЕНИЙ НА ОСНОВ Е ИНДИЯ
inferredcites →https://doi.org/10.1007/bf02576012openalex-snapshot
Some algorithms solving the unilateral dirichlet problem with two constraints
inferredcites →https://doi.org/10.1007/bfb0080123openalex-snapshot
Solution of linear complementarity problems by linear programming
inferredcites →https://doi.org/10.1007/bfb0120784openalex-snapshot
On solving linear complementarity problems as linear programs
inferredcites →https://doi.org/10.1007/bfb0120786openalex-snapshot
A linear complementarity problem with an n by 2n “P”-matrix
inferredcites →https://doi.org/10.1016/0024-3795(68)90052-9openalex-snapshot
Complementary pivot theory of mathematical programming
inferredcites →https://doi.org/10.1016/0024-3795(79)90015-6openalex-snapshot
A new characterization of real H-matrices with positive diagonals
inferredcites →https://doi.org/10.1016/0041-5553(69)90035-4openalex-snapshot
The conjugate gradient method in extremal problems
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.1051/m2an/197307r300051openalex-snapshot
Sur des méthodes d'optimisation par relaxation
inferredcites →https://doi.org/10.1090/procopenalex-snapshot
Proceedings of the American Mathematical Society
inferredcites →https://doi.org/10.1137/0309028openalex-snapshot
The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
inferredcites →https://doi.org/10.1287/mnsc.17.9.547openalex-snapshot
Least d-Majorized Network Flows with Inventory and Statistical Applications
inferredcites →https://doi.org/10.21136/cmj.1962.100526openalex-snapshot
On matrices with non-positive off-diagonal elements and positive principal minors
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.1007/978-1-4757-3141-5_2openalex-snapshot
Complementarity Problems. Origins and Definitions
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_15openalex-snapshot
Algorithms for Linear Complementarity Problems
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/bf00429751openalex-snapshot
An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf00939332openalex-snapshot
Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
inferred← citeshttps://doi.org/10.1007/bf00940317openalex-snapshot
Basic-set algorithm for a generalized linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf01588800openalex-snapshot
On the solution of concave knapsack problems
inferred← citeshttps://doi.org/10.1007/bf02591868openalex-snapshot
Iterative methods for linear complementarity problems with upperbounds on primary variables
inferred← citeshttps://doi.org/10.1007/bf02612339openalex-snapshot
Newton's method for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bfb0008387openalex-snapshot
Solving some optimal control problems using the barrier penalty function method
inferred← citeshttps://doi.org/10.1007/bfb0043917openalex-snapshot
Monotone sequences of feasible solutions for quadratic programming problems with M-matrices and box constraints
inferred← citeshttps://doi.org/10.1007/bfb0120786openalex-snapshot
A linear complementarity problem with an n by 2n “P”-matrix
inferred← citeshttps://doi.org/10.1007/bfb0121072openalex-snapshot
Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
inferred← citeshttps://doi.org/10.1007/s10107-021-01766-4openalex-snapshot
Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
inferred← citeshttps://doi.org/10.1007/s10107-023-01966-0openalex-snapshot
Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90077-0openalex-snapshot
On cone orderings and the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/0024-3795(79)90015-6openalex-snapshot
A new characterization of real H-matrices with positive diagonals
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)90095-6openalex-snapshot
Quadratic programming with M-Matrices
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(93)00184-2openalex-snapshot
Generalizations of P0- and P-properties; extended vertical and horizontal linear complementarity problems
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/0377-2217(89)90168-9openalex-snapshot
A finite improvement algorithm for the linear complementarity problem
inferred← citeshttps://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.
inferred← citeshttps://doi.org/10.1016/j.laa.2010.12.031openalex-snapshot
Nonnegative generalized inverses and least elements of polyhedral sets
inferred← citeshttps://doi.org/10.1137/22m1514982openalex-snapshot
Continuous Selections of Solutions to Parametric Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s1052623401384151openalex-snapshot
A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P 0 LCPs
inferred← citeshttps://doi.org/10.1287/moor.26.1.119.10594openalex-snapshot
On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems
inferred← citeshttps://doi.org/10.1287/opre.28.3.754openalex-snapshot
A New and Efficient Algorithm for a Class of Portfolio Selection Problems
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.