On the public citation graph
The ellipsoid method and its implications
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.
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/978-3-642-68874-4_20openalex-snapshot
The Problem of the Average Speed of the Simplex Method
inferredcites →https://doi.org/10.1007/bf01068830openalex-snapshot
Certain questions of convergence of generalized gradient descent
inferredcites →https://doi.org/10.1007/bf01068900openalex-snapshot
Family of algorithms for solving convex programming problems
inferredcites →https://doi.org/10.1007/bf01070435openalex-snapshot
Convergence of a gradient method with space dilation in the direction of the difference between two successive gradients
inferredcites →https://doi.org/10.1007/bf01070454openalex-snapshot
A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients
inferredcites →https://doi.org/10.1007/bf01070506openalex-snapshot
Convergence rate of the gradient descent method with dilatation of the space
inferredcites →https://doi.org/10.1007/bf01071394openalex-snapshot
Cut-off method with space extension in convex programming problems
inferredcites →https://doi.org/10.1007/bf01071403openalex-snapshot
Methods of solution of nonlinear extremal problems
inferredcites →https://doi.org/10.1007/bf01073933openalex-snapshot
The rate of convergence of the generalized gradient descent method
inferredcites →https://doi.org/10.1007/bf01098719openalex-snapshot
Two inequalities for volumes of convex bodies
inferredcites →https://doi.org/10.1007/bf01396759openalex-snapshot
On Khachian's algorithm and minimal ellipsoids
inferredcites →https://doi.org/10.1007/bf01580132openalex-snapshot
A bad network problem for the simplex method and other minimum cost flow algorithms
inferredcites →https://doi.org/10.1007/bf01583776openalex-snapshot
Modifications and implementation of the ellipsoid algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf01917108openalex-snapshot
The Average number of pivot steps required by the Simplex-Method is polynomial
inferredcites →https://doi.org/10.1007/bf02341816openalex-snapshot
Utilization of the operation of space dilatation in the minimization of convex functions
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02592220openalex-snapshot
A class of rank-two ellipsoid algorithms for convex programming
inferredcites →https://doi.org/10.1007/bfb0004505openalex-snapshot
A note on convergence proofs for Shor-Khachian-Methods
inferredcites →https://doi.org/10.1007/bfb0120921openalex-snapshot
Khachiyan’s algorithm for linear programming
inferredcites →https://doi.org/10.1016/0012-365x(73)90171-4openalex-snapshot
The simplex algorithm with the pivot rule of maximizing criterion improvement
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0041-5553(80)90098-1openalex-snapshot
The polynomial solvability of convex quadratic programming
inferredcites →https://doi.org/10.1016/0166-218x(79)90004-0openalex-snapshot
Worst case behavior of the steepest edge simplex method
inferredcites →https://doi.org/10.1016/0167-6377(82)90047-5openalex-snapshot
Complexity of linear programming
inferredcites →https://doi.org/10.1016/0378-4754(83)90086-1openalex-snapshot
Modern applied mathematics—optimization and operations research
inferredcites →https://doi.org/10.1109/sfcs.1982.63openalex-snapshot
An old linear programming algorithm runs in polynomial time
inferredcites →https://doi.org/10.1137/0211053openalex-snapshot
On Linear Characterizations of Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1287/moor.7.2.245openalex-snapshot
Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems
inferredcites →https://doi.org/10.1287/moor.7.2.253openalex-snapshot
On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
inferredcites →https://doi.org/10.4153/cjm-1954-037-2openalex-snapshot
The Relaxation Method for Linear Inequalities
inferredcites →https://doi.org/10.4153/cjm-1954-038-xopenalex-snapshot
The Relaxation Method for Linear Inequalities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cptc.202300091openalex-snapshot
A BODIPY‐Based Molecular Rotor in Giant Unilamellar Vesicles: A Case Study by Polarization‐Resolved Time‐Resolved Emission and Transient Absorption Spectroscopy
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50023-7openalex-snapshot
Mathematical Programming and Convex Geometry
inferred← citeshttps://doi.org/10.1201/b10975-17openalex-snapshot
Cooperation Incentives in 4G Networks
inferred← citeshttps://doi.org/10.1287/moor.10.3.515openalex-snapshot
On the Solution of Variational Inequalities by the Ellipsoid Method
inferred← citeshttps://doi.org/10.1287/opre.1090.0741openalex-snapshot
Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
inferred← citeshttps://doi.org/10.32657/10356/51122openalex-snapshot
Representations of tolerance graphs
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.