On the public citation graph

Dikin's algorithm for matrix linear programming problems

https://doi.org/10.1007/bfb0035472
0 signed · 16 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/978-3-642-75536-1_50openalex-snapshot
Applications of Analytic Centers
inferredcites →https://doi.org/10.1007/bf02592024openalex-snapshot
A variation on Karmarkar’s algorithm for solving linear programming problems
inferredcites →https://doi.org/10.1016/0167-2789(91)90062-eopenalex-snapshot
Hamiltonian structure of dynamical systems which solve linear programming problems
inferredcites →https://doi.org/10.1090/s0002-9947-1989-1005525-6openalex-snapshot
The nonlinear geometry of linear programming. I. Affine and projective scaling trajectories
inferredcites →https://doi.org/10.1137/0323032openalex-snapshot
Semi-Definite Matrix Constraints in Optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-29041-1_5openalex-snapshot
Grasping and Control of Multi-Fingered Hands
inferred← citeshttps://doi.org/10.1007/978-3-7908-2693-7_1openalex-snapshot
A Masked Spectral Bound for Maximum-Entropy Sampling
inferred← citeshttps://doi.org/10.1007/bf02680567openalex-snapshot
Affine scaling algorithm fails for semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-018-1314-0openalex-snapshot
A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
inferred← citeshttps://doi.org/10.1109/acc.2011.5991236openalex-snapshot
A grasping force optimization algorithm with dynamic torque constraints selection for multi-fingered robotic hands
inferred← citeshttps://doi.org/10.1109/icra.2011.5979674openalex-snapshot
Online dextrous-hand grasping force optimization with dynamic torque constraints selection
inferred← citeshttps://doi.org/10.1109/robot.1997.620115openalex-snapshot
Recursive algorithms for real-time grasping force optimization
inferred← citeshttps://doi.org/10.1109/tcst.2004.833630openalex-snapshot
On Geometric Algorithms for Real-Time Grasping Force Optimization
inferred← citeshttps://doi.org/10.1109/tro.2012.2212633openalex-snapshot
A Grasping Force Optimization Algorithm for Multiarm Robots With Multifingered Hands
inferred← citeshttps://doi.org/10.1177/027836499801700802openalex-snapshot
Dikin-Type Algorithms for Dextrous Grasping Force Optimization
inferred← citeshttps://doi.org/10.1287/moor.24.1.149openalex-snapshot
Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming
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.