On the public citation graph
On the gradient-projection method for solving the nonsymmetric linear complementarity problem
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/bf01696240openalex-snapshot
ИССЛЕДОВАНИЕ НЕКОТО РЫХ СЛОЖНЫХ ПОЛУПРОВОДНИКОВЫХ Т ВДРДЫХ РАСТВОРОВ И СОЕДИНЕНИЙ НА ОСНОВ Е ИНДИЯ
inferredcites →https://doi.org/10.1007/bfb0120782openalex-snapshot
Computational complexity of complementary pivot methods
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(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/0041-5553(66)90114-5openalex-snapshot
Constrained minimization methods
inferredcites →https://doi.org/10.1109/tac.1976.1101194openalex-snapshot
On the Goldstein-Levitin-Polyak gradient projection method
inferredcites →https://doi.org/10.1137/0317052openalex-snapshot
Nonlinear Perturbation of Linear Programs
inferredcites →https://doi.org/10.1287/mnsc.11.7.681openalex-snapshot
Bimatrix Equilibrium Points and Mathematical Programming
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/jnm.1660080605openalex-snapshot
Neural network approach to the solution of linear complementarity problems
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_15openalex-snapshot
Algorithms for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/bf01195027openalex-snapshot
Monotonicity of metric projections onto positive cones of ordered Euclidean spaces
inferred← citeshttps://doi.org/10.1007/bf02096261openalex-snapshot
Error bounds and convergence analysis of feasible descent methods: a general approach
inferred← citeshttps://doi.org/10.1007/bf02186474openalex-snapshot
Two-stage parallel iterative methods for the symmetric linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf02680549openalex-snapshot
A variable-penalty alternating directions method for convex optimization
inferred← citeshttps://doi.org/10.1007/bfb0121176openalex-snapshot
An implicit enumeration procedure for the general linear complementarity problem
inferred← citeshttps://doi.org/10.1007/s10255-006-0299-2openalex-snapshot
Global Convergence of a Modified Gradient Projection Method for Convex Constrained Problems
inferred← citeshttps://doi.org/10.1007/s10589-015-9777-xopenalex-snapshot
Bounded perturbation resilience of projected scaled gradient methods
inferred← citeshttps://doi.org/10.1007/s13226-023-00403-4openalex-snapshot
Projected fixed point iterative method for large and sparse horizontal linear complementarity problem
inferred← citeshttps://doi.org/10.1016/0022-247x(88)90408-8openalex-snapshot
Iterative methods for a class of complementarity problems
inferred← citeshttps://doi.org/10.1016/0022-247x(90)90277-mopenalex-snapshot
Projection methods, isotone projection cones, and the complementarity problem
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90043-3openalex-snapshot
Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.amc.2006.06.013openalex-snapshot
Solving linear variational inequality problems by a self-adaptive projection method
inferred← citeshttps://doi.org/10.1016/j.amc.2006.08.167openalex-snapshot
Two parallel distribution algorithms for convex constrained minimization problems
inferred← citeshttps://doi.org/10.1016/j.cam.2004.10.018openalex-snapshot
Convergence properties of nonmonotone spectral projected gradient methods
inferred← citeshttps://doi.org/10.1016/j.cam.2008.02.013openalex-snapshot
Inexact multisplitting methods for linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.jsv.2022.117383openalex-snapshot
An alternate state-space algorithm for dynamic solution, sensitivity analysis and parameter identification of dry friction systems
inferred← citeshttps://doi.org/10.1016/j.na.2010.06.051openalex-snapshot
Convergence of a projected gradient method variant for quasiconvex objectives
inferred← citeshttps://doi.org/10.1023/a:1008714607737openalex-snapshot
Convergence of the Gradient Projection Method for Generalized Convex Minimization
inferred← citeshttps://doi.org/10.1080/02331934.2015.1022546openalex-snapshot
A representation of the solution set of a class of linear complementarity problems
inferred← citeshttps://doi.org/10.1080/10556789408805581openalex-snapshot
Serial and parallel backpropagation convergence via nonmonotone perturbed minimization
inferred← citeshttps://doi.org/10.1109/tac.1986.1104154openalex-snapshot
Comments on "An iterative method for generalized complementarity problems"
inferred← citeshttps://doi.org/10.1111/j.1467-8276.2007.00999.xopenalex-snapshot
Dynamic Efficiency Measurement: Theory and Application
inferred← citeshttps://doi.org/10.1137/0329057openalex-snapshot
On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0330025openalex-snapshot
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
inferred← citeshttps://doi.org/10.1137/0612047openalex-snapshot
Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0801009openalex-snapshot
Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0801036openalex-snapshot
On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
inferred← citeshttps://doi.org/10.1137/0803008openalex-snapshot
Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/080738970openalex-snapshot
A Singular Value Thresholding Algorithm for Matrix Completion
inferred← citeshttps://doi.org/10.1137/17m1147214openalex-snapshot
An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs
inferred← citeshttps://doi.org/10.1155/2015/623293openalex-snapshot
A Smooth System of Equations Approach to Complementarity Problems for Frictionless Contacts
inferred← citeshttps://doi.org/10.22004/ag.econ.25771openalex-snapshot
Dynamic Efficiency Analysis using a Directional Distance Function
inferred← citeshttps://doi.org/10.22436/jnsa.010.10.36openalex-snapshot
Perturbation resilience of proximal gradient algorithm for composite objectives
inferred← citeshttps://doi.org/10.3934/math.2021691openalex-snapshot
General fixed-point method for solving the linear complementarity problem
inferred← citeshttps://doi.org/10.48550/arxiv.1609.02609openalex-snapshot
An Iterative Method for Nonconvex Quadratically Constrained Quadratic Programs
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.