On the public citation graph

On the convergence of a block successive over-relaxation method for a class of linear complementarity problems

https://doi.org/10.1007/bfb0120964

0 signed · 40 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/bf01442149openalex-snapshot

On the solution of large, structured linear complementarity problems: The block partitioned case

inferredcites →https://doi.org/10.1007/bfb0120987openalex-snapshot

Characterizations of bounded solutions of linear complementarity problems

inferredcites →https://doi.org/10.1007/bfb0121241openalex-snapshot

Solution rays for a class of complementarity 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.1016/c2013-0-11125-7openalex-snapshot

Nonlinear Programming 3

inferredcites →https://doi.org/10.1137/0112056openalex-snapshot

Note on a Fundamental Theorem in Quadratic Programming

inferredcites →https://doi.org/10.1137/0718039openalex-snapshot

Iterative Solution of Linear Programs

inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot

Convex Analysis

inferredcites →https://doi.org/10.2307/1909424openalex-snapshot

Nonlinear Programming: A Unified Approach

inferredcites →https://doi.org/10.2307/2343701openalex-snapshot

Nonlinear Programming: A Unified Approach.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nav.3800330106openalex-snapshot

A lagrangean relaxation algorithm for the constrained matrix problem

inferred← citeshttps://doi.org/10.1002/net.3230190108openalex-snapshot

Implementing an “exact” Newton method for separable convex transportation problems

inferred← citeshttps://doi.org/10.1002/net.3230210407openalex-snapshot

Computational development of a lagrangian dual approach for quadratic networks

inferred← citeshttps://doi.org/10.1007/bf00934130openalex-snapshot

Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem

inferred← citeshttps://doi.org/10.1007/bf00939250openalex-snapshot

More results on the convergence of iterative methods for the symmetric linear complementarity problem

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/bf00941397openalex-snapshot

Descent methods for convex essentially smooth minimization

inferred← citeshttps://doi.org/10.1007/bf01582249openalex-snapshot

On multilevel iterative methods for optimization problems

inferred← citeshttps://doi.org/10.1007/bf01585112openalex-snapshot

Iterative methods for variational and complementarity problems

inferred← citeshttps://doi.org/10.1007/bf01589405openalex-snapshot

Dual coordinate step methods for linear network flow problems

inferred← citeshttps://doi.org/10.1007/bf02592017openalex-snapshot

Relaxation methods for problems with strictly convex separable costs and linear constraints

inferred← citeshttps://doi.org/10.1007/s10957-021-01922-yopenalex-snapshot

Projected Splitting Methods for Vertical Linear Complementarity Problems

inferred← citeshttps://doi.org/10.1016/0098-1354(83)80004-0openalex-snapshot

Methods for quadratic programming: A survey

inferred← citeshttps://doi.org/10.1016/0377-0427(94)00103-2openalex-snapshot

A multisplitting method for symmetric linear complementarity problems

inferred← citeshttps://doi.org/10.1016/0377-2217(84)90160-7openalex-snapshot

A polynomial algorithm for minimum quadratic cost flow problems

inferred← citeshttps://doi.org/10.1016/j.amc.2023.128378openalex-snapshot

A new matrix splitting generalized iteration method for linear complementarity problems

inferred← citeshttps://doi.org/10.1016/j.cam.2023.115138openalex-snapshot

The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems

inferred← citeshttps://doi.org/10.1016/j.cam.2023.115430openalex-snapshot

Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem

inferred← citeshttps://doi.org/10.1016/j.ejor.2006.12.006openalex-snapshot

A survey on the continuous nonlinear resource allocation problem

inferred← citeshttps://doi.org/10.1080/00207168608803522openalex-snapshot

Iterative algorithms for the linear complementarity problem

inferred← citeshttps://doi.org/10.1090/s0025-5718-1983-0701631-xopenalex-snapshot

The Numerical Solution of Equality-Constrained Quadratic Programming Problems

inferred← citeshttps://doi.org/10.1137/0325006openalex-snapshot

Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems

inferred← citeshttps://doi.org/10.1137/0325023openalex-snapshot

Iterative Methods for Large Convex Quadratic Programs: A Survey

inferred← citeshttps://doi.org/10.1137/0325067openalex-snapshot

Relaxation Methods for Network Flow Problems with Convex Arc Costs

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/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/0610020openalex-snapshot

Continuous Homotopies for the Linear Complementarity Problem

inferred← citeshttps://doi.org/10.1287/moor.16.3.462openalex-snapshot

Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints

inferred← citeshttps://doi.org/10.21236/ada148027openalex-snapshot

Distributed Asynchronous Relaxation Methods for Convex Network Flow 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.