On the public citation graph

Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs

https://doi.org/10.1007/bf02186473
0 signed · 45 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.1007/bf00940194openalex-snapshot
Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
inferredcites →https://doi.org/10.1007/bf00940404openalex-snapshot
An elementary proof of the maximum principle for optimal control problems governed by a Volterra integral equation
inferredcites →https://doi.org/10.1007/bf01268170openalex-snapshot
Solution of symmetric linear complementarity problems by iterative methods
inferredcites →https://doi.org/10.1007/bf01448356openalex-snapshot
Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
inferredcites →https://doi.org/10.1007/bfb0121017openalex-snapshot
Normal solutions of linear programs
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.1016/0305-0548(69)90004-5openalex-snapshot
Sparsity-preserving sor algorithms for separable quadratic and linear programming
inferredcites →https://doi.org/10.1109/tse.1987.233513openalex-snapshot
The Crystal Multicomputer: Design and Implementation Experience
inferredcites →https://doi.org/10.1137/0325023openalex-snapshot
Iterative Methods for Large Convex Quadratic Programs: A Survey
inferredcites →https://doi.org/10.1137/0325033openalex-snapshot
Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
inferredcites →https://doi.org/10.1137/1.9781611971255openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.2307/2005671openalex-snapshot
Numerical Analysis, A Second Course
inferredcites →https://doi.org/10.2307/2005896openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.2307/2319468openalex-snapshot
Numerical Analysis: A Second Course.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.4330050802openalex-snapshot
Massively parallel solution of quadratic programs via successive overrelaxation
inferred← citeshttps://doi.org/10.1007/0-306-48026-3_18openalex-snapshot
An Overview on Projection-Type Methods for Convex Large-Scale Quadratic Programs
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_479openalex-snapshot
Splitting Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_630openalex-snapshot
Splitting Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0239-1_10openalex-snapshot
Variable Projection Methods for Large—Scale Quadratic Optimization in Data Analysis Applications
inferred← citeshttps://doi.org/10.1007/978-1-4613-3279-4_13openalex-snapshot
Parallel Solution of Large Scale Quadratic Programs
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_12openalex-snapshot
Optimization Methods in Massive Data Sets
inferred← citeshttps://doi.org/10.1007/978-1-4757-3226-9_21openalex-snapshot
On the Efficiency of Splitting and Projection Methods for Large Strictly Convex Quadratic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-17319-6_7openalex-snapshot
Extending Open Dynamics Engine for Robotics Simulation
inferred← citeshttps://doi.org/10.1007/978-3-642-46631-1_11openalex-snapshot
Serial and Parallel Solution of Large Scale Linear Programs by Augmented Lagrangian Successive Overrelaxation
inferred← citeshttps://doi.org/10.1007/bf00939948openalex-snapshot
On the convergence of the coordinate descent method for convex differentiable minimization
inferred← citeshttps://doi.org/10.1007/bf00940507openalex-snapshot
Decomposition algorithm for convex differentiable minimization
inferred← citeshttps://doi.org/10.1007/bf00940641openalex-snapshot
Partially and totally asynchronous algorithms for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf00941397openalex-snapshot
Descent methods for convex essentially smooth minimization
inferred← citeshttps://doi.org/10.1007/bf01581703openalex-snapshot
A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf01589410openalex-snapshot
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
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/s10107-007-0170-0openalex-snapshot
A coordinate gradient descent method for nonsmooth separable minimization
inferred← citeshttps://doi.org/10.1007/s11075-008-9218-3openalex-snapshot
A hybrid algorithm for solving linear inequalities in a least squares sense
inferred← citeshttps://doi.org/10.1016/0305-0548(91)90090-eopenalex-snapshot
Parallel processing and OR/MS
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00600-0openalex-snapshot
The adventures of a simple algorithm
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80011-2openalex-snapshot
On Theory and Practice of Row Relaxation Methods
inferred← citeshttps://doi.org/10.1023/a:1004605612267openalex-snapshot
A Modified Projection Algorithm for Large Strictly-Convex Quadratic Programs
inferred← citeshttps://doi.org/10.1080/07421222.1989.11517865openalex-snapshot
The Impact of Parallel and Neural Computing on Managerial Decision Making
inferred← citeshttps://doi.org/10.1109/72.788643openalex-snapshot
Successive overrelaxation for support vector machines
inferred← citeshttps://doi.org/10.1137/0328011openalex-snapshot
Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
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.1287/opre.37.6.985openalex-snapshot
OR Forum—Perspectives on Parallel Computing
inferred← citeshttps://doi.org/10.15807/jorsj.39.407openalex-snapshot
A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
inferred← citeshttps://doi.org/10.4018/978-1-4666-9644-0.ch021openalex-snapshot
Verification of Iterative Methods for the Linear Complementarity Problem
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.