On the public citation graph
A unifying geometric solution framework and complexity analysis for variational inequalities
0 signed · 61 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.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-1-4615-2025-2openalex-snapshot
Handbook of Global Optimization
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-94-011-2178-1openalex-snapshot
Network Economics: A Variational Inequality Approach
inferredcites →https://doi.org/10.1007/bf01068854openalex-snapshot
New development trends in nondifferentiable optimization
inferredcites →https://doi.org/10.1007/bf01071394openalex-snapshot
Cut-off method with space extension in convex programming problems
inferredcites →https://doi.org/10.1007/bf01098719openalex-snapshot
Two inequalities for volumes of convex bodies
inferredcites →https://doi.org/10.1007/bf01582255openalex-snapshot
Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
inferredcites →https://doi.org/10.1007/bf01582258openalex-snapshot
Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
inferredcites →https://doi.org/10.1007/bf01590959openalex-snapshot
A unifying geometric solution framework and complexity analysis for variational inequalities
inferredcites →https://doi.org/10.1007/springerreference_5340openalex-snapshot
Complementarity problems
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0167-6377(82)90049-9openalex-snapshot
The gap function of a convex program
inferredcites →https://doi.org/10.1016/0377-2217(94)90433-2openalex-snapshot
Network economics: a variational inequality approach
inferredcites →https://doi.org/10.1016/0378-4754(84)90101-0openalex-snapshot
Problem complexity and method efficiency in optimization
inferredcites →https://doi.org/10.1016/s0168-2024(08)70034-1openalex-snapshot
Chapter IX Applications of the Method of Multipliers to Variational Inequalities
inferredcites →https://doi.org/10.1016/s0168-2024(08)x7003-1openalex-snapshot
Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems
inferredcites →https://doi.org/10.1109/sfcs.1982.63openalex-snapshot
An old linear programming algorithm runs in polynomial time
inferredcites →https://doi.org/10.1109/sfcs.1989.63500openalex-snapshot
A new algorithm for minimizing convex functions over convex sets
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1137/1.9780898719451openalex-snapshot
An Introduction to Variational Inequalities and Their Applications
inferredcites →https://doi.org/10.1137/1.9781611970203openalex-snapshot
An Algorithmic Theory of Numbers, Graphs and Convexity
inferredcites →https://doi.org/10.1137/s1052623493259227openalex-snapshot
The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms
inferredcites →https://doi.org/10.1137/s1052623494250415openalex-snapshot
Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
inferredcites →https://doi.org/10.1145/102782.102783openalex-snapshot
A random polynomial-time algorithm for approximating the volume of convex bodies
inferredcites →https://doi.org/10.1145/73007.73043openalex-snapshot
A random polynomial time algorithm for approximating the volume of convex bodies
inferredcites →https://doi.org/10.1287/moor.10.3.515openalex-snapshot
On the Solution of Variational Inequalities by the Ellipsoid Method
inferredcites →https://doi.org/10.1287/moor.12.4.678openalex-snapshot
Generalized Descent Methods for Asymmetric Systems of Equations
inferredcites →https://doi.org/10.1287/opre.29.6.1039openalex-snapshot
Feature Article—The Ellipsoid Method: A Survey
inferredcites →https://doi.org/10.2307/2153188openalex-snapshot
Nonlinear Optimization: Complexity Issues.
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/2582404openalex-snapshot
Mathematical Programming: Theory and Algorithms.
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0947openalex-snapshot
Variational Inequalities
inferred← citeshttps://doi.org/10.1007/0-387-23393-8_13openalex-snapshot
Generalized Monotone Equilibrium Problems and Variational Inequalities
inferred← citeshttps://doi.org/10.1007/978-1-4615-5197-3_8openalex-snapshot
On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities
inferred← citeshttps://doi.org/10.1007/s10107-003-0476-5openalex-snapshot
Solving variational inequality and fixed point problems by line searches and potential optimization
inferred← citeshttps://doi.org/10.1007/s10107-024-02075-2openalex-snapshot
Perseus: a simple and optimal high-order method for variational inequalities
inferred← citeshttps://doi.org/10.1007/s10589-007-9013-4openalex-snapshot
Solving variational inequalities defined on a domain with infinitely many linear constraints
inferred← citeshttps://doi.org/10.1016/j.apnum.2010.10.001openalex-snapshot
Some Goldstein's type methods for co-coercive variant variational inequalities
inferred← citeshttps://doi.org/10.1016/j.orl.2005.09.006openalex-snapshot
Solving asymmetric variational inequalities via convex optimization
inferred← citeshttps://doi.org/10.1016/j.orl.2006.07.002openalex-snapshot
Global bounds for the distance to solutions of co-coercive variational inequalities
inferred← citeshttps://doi.org/10.1016/s0167-6377(96)00029-6openalex-snapshot
An analytic center cutting plane method for pseudomonotone variational inequalities
inferred← citeshttps://doi.org/10.1016/s0191-2615(96)00034-3openalex-snapshot
Bicriterion traffic assignment: Efficient algorithms plus examples
inferred← citeshttps://doi.org/10.1023/a:1008671815550openalex-snapshot
On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities
inferred← citeshttps://doi.org/10.1023/a:1011219303531openalex-snapshot
A Cutting Plane Method for Solving Quasimonotone Variational Inequalities
inferred← citeshttps://doi.org/10.1023/b:jogo.0000015308.49676.eaopenalex-snapshot
An Analytic Center Cutting Plane Method for Solving Semi-Infinite Variational Inequality Problems
inferred← citeshttps://doi.org/10.1137/090753127openalex-snapshot
On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
inferred← citeshttps://doi.org/10.1137/s105262349732829xopenalex-snapshot
Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
inferred← citeshttps://doi.org/10.1137/s1052623499357957openalex-snapshot
Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application
inferred← citeshttps://doi.org/10.1155/2007/37217openalex-snapshot
Global Bounds for Cocoercive Variational Inequalities
inferred← citeshttps://doi.org/10.1177/1687814015616573openalex-snapshot
Dynamic traffic analysis model of multiple passengers for urban public transport corridor
inferred← citeshttps://doi.org/10.1287/ijoc.1030.0065openalex-snapshot
The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach
inferred← citeshttps://doi.org/10.1287/moor.1090.0408openalex-snapshot
Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
inferred← citeshttps://doi.org/10.1287/moor.22.3.568openalex-snapshot
Averaging Schemes for Variational Inequalities and Systems of Equations
inferred← citeshttps://doi.org/10.1287/opre.47.2.327openalex-snapshot
Network-Optimized Road Pricing: Part II: Algorithms and Examples
inferred← citeshttps://doi.org/10.1287/trsc.30.2.93openalex-snapshot
Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
inferred← citeshttps://doi.org/10.21236/ada495929openalex-snapshot
Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
inferred← citeshttps://doi.org/10.5451/unibas-002036651openalex-snapshot
Numerische Lösung des parabolischen Hindernisproblems mit einer inneren Punkte Methode
showing the first 26 of 27 · page through all 27
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.