On the public citation graph
Stable modification of explicitLU factors for simplex updates
0 signed · 32 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/bf01436076openalex-snapshot
Triangular factors of modified matrices
inferredcites →https://doi.org/10.1007/bf01584548openalex-snapshot
Updated triangular factors of the basis to maintain sparsity in the product form simplex method
inferredcites →https://doi.org/10.1007/bf02169151openalex-snapshot
A stabilization of the simplex method
inferredcites →https://doi.org/10.1007/bf02591889openalex-snapshot
Large-scale linear programming: Geometry, working bases and factorizations
inferredcites →https://doi.org/10.1016/0024-3795(73)90047-5openalex-snapshot
A numerically stable form of the simplex algorithm
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50017-9openalex-snapshot
A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING††Research for this paper was supported by the Energy Research and Development Administration Contract AT(04-3)-326 PA #18, at Stanford University.
inferredcites →https://doi.org/10.1016/s0141-1195(82)80062-4openalex-snapshot
Practical Methods of Optimization Volume 2 — Constrained Optimization
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0804936-9openalex-snapshot
A Stable Algorithm for Updating Triangular Factors Under a Rank One Change
inferredcites →https://doi.org/10.1137/0708061openalex-snapshot
Analysis of the Diagonal Pivoting Method
inferredcites →https://doi.org/10.1145/362946.362974openalex-snapshot
The simplex method of linear programming using LU decomposition
inferredcites →https://doi.org/10.1287/mnsc.3.3.255openalex-snapshot
The Elimination form of the Inverse and its Application to Linear Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-18991-2_46openalex-snapshot
Parallel systolic LU factorization for simplex updates
inferred← citeshttps://doi.org/10.1007/978-1-4615-5197-3_11openalex-snapshot
Interfaces to PATH 3.0: Design, Implementation and Usage
inferred← citeshttps://doi.org/10.1007/978-3-642-83724-1_5openalex-snapshot
Methods for Large-Scale Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-21637-8_4openalex-snapshot
A Sensitivity Method for Solving Multistage Stochastic Linear Programming Problems
inferred← citeshttps://doi.org/10.1007/bf00940892openalex-snapshot
Sensitivity method for basis inverse representation in multistage stochastic linear programming problems
inferred← citeshttps://doi.org/10.1007/bf02025532openalex-snapshot
On the use of dense matrix techniques within sparse simplex
inferred← citeshttps://doi.org/10.1007/s10589-021-00330-2openalex-snapshot
A reduced proximal-point homotopy method for large-scale non-convex BQP
inferred← citeshttps://doi.org/10.1007/s12532-014-0071-1openalex-snapshot
qpOASES: a parametric active-set algorithm for quadratic programming
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90127-3openalex-snapshot
On error growth in the Bartels-Golub and Fletcher-Matthews algorithms for updating matrix factorizations
inferred← citeshttps://doi.org/10.1016/0024-3795(88)90026-2openalex-snapshot
Degeneracy in the presence of roundoff errors
inferred← citeshttps://doi.org/10.1016/j.jcp.2016.11.014openalex-snapshot
A splitting-free vorticity redistribution method
inferred← citeshttps://doi.org/10.1023/a:1008636318275openalex-snapshot
Interfaces to PATH 3.0: Design, Implementation and Usage
inferred← citeshttps://doi.org/10.1080/02331939208843741openalex-snapshot
Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion
inferred← citeshttps://doi.org/10.1080/10556788.2010.512956openalex-snapshot
A pivoting algorithm for linear programming with linear complementarity constraints
inferred← citeshttps://doi.org/10.1090/s0025-5718-1985-0804936-9openalex-snapshot
A Stable Algorithm for Updating Triangular Factors Under a Rank One Change
inferred← citeshttps://doi.org/10.1098/rsbm.2024.0037openalex-snapshot
Roger Fletcher. 29 January 1939—15 July 2016
inferred← citeshttps://doi.org/10.1137/0610029openalex-snapshot
Updating the Triangular Factorization of a Matrix
inferred← citeshttps://doi.org/10.1504/ijmor.2012.048901openalex-snapshot
A review of the LU update in the simplex algorithm
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.