On the public citation graph

Matrix augmentation and partitioning in the updating of the basis inverse

https://doi.org/10.1007/bf01584341
0 signed · 59 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.1002/zamm.19720520620openalex-snapshot
C. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems. (Series in Automatic Computation) XI + 148 S. Englewood Cliffs, N.J. 1967. Prentice‐Hall, Inc. Preis geb. 54 s. net
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3openalex-snapshot
Sparse Matrices and their Applications
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3_16openalex-snapshot
The Role of Partitioning in the Numerical Solution of Sparse Systems
inferredcites →https://doi.org/10.1007/978-1-4615-8675-3_7openalex-snapshot
Modifying Triangular Factors of the Basis in the Simplex Method
inferredcites →https://doi.org/10.1007/bf01584086openalex-snapshot
Reinversion with the preassigned pivot procedure
inferredcites →https://doi.org/10.1007/bf01584343openalex-snapshot
On the Bartels—Golub decomposition for linear programming bases
inferredcites →https://doi.org/10.1007/bf01585094openalex-snapshot
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
inferredcites →https://doi.org/10.1007/bfb0120717openalex-snapshot
An accuracy test for updating triangular factors
inferredcites →https://doi.org/10.1016/s0022-0000(67)80015-1openalex-snapshot
Generalized upper bounding techniques
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0343558-6openalex-snapshot
Methods for Modifying Matrix Factorizations
inferredcites →https://doi.org/10.1109/tsmc.1971.4308301openalex-snapshot
Optimization Theory of Large Systems
inferredcites →https://doi.org/10.1145/362946.362974openalex-snapshot
The simplex method of linear programming using LU decomposition
inferredcites →https://doi.org/10.1214/aoms/1177733256openalex-snapshot
The Annals of Mathematical Statistics
inferredcites →https://doi.org/10.21236/ad0623465openalex-snapshot
AN EXTENSION OF GENERALIZED UPPER BOUNDED TECHNIQUES FOR LINEAR PROGRAMMING
inferredcites →https://doi.org/10.2307/2004501openalex-snapshot
Computer Solution of Linear Algebraic Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.3230160306openalex-snapshot
Solving stochastic programs with network recourse
inferred← citeshttps://doi.org/10.1007/3-540-12914-6_6openalex-snapshot
Chapter 6 Large sparse quadratic programs
inferred← citeshttps://doi.org/10.1007/978-1-4613-0263-6_8openalex-snapshot
Numerical Methods for Large-Scale Non-Convex Quadratic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_6openalex-snapshot
Sequential Quadratic Programming Methods
inferred← citeshttps://doi.org/10.1007/978-1-4684-6389-7_51openalex-snapshot
Stable Variant of the Simplex Method for Solving Supersparse Linear Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-61370-8_3openalex-snapshot
Large Scale Linear Programming Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-61370-8_4openalex-snapshot
Nonlinear Programming Techniques Applied to Stochastic Programs with Recourse
inferred← citeshttps://doi.org/10.1007/978-3-642-83724-1_2openalex-snapshot
Advances in Nonlinear Network Models and Algorithms
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/bf01580872openalex-snapshot
Mslip: A computer code for the multistage stochastic linear programming problem
inferred← citeshttps://doi.org/10.1007/bf01580883openalex-snapshot
A regularized decomposition method for minimizing a sum of polyhedral functions
inferred← citeshttps://doi.org/10.1007/bf01581267openalex-snapshot
Parallel decomposition of multistage stochastic programming problems
inferred← citeshttps://doi.org/10.1007/bf01588292openalex-snapshot
Matrix augmentation and structure preservation in linearly constrained control problems
inferred← citeshttps://doi.org/10.1007/bf01588296openalex-snapshot
A bump triangular dynamic factorization algorithm for the simplex method
inferred← citeshttps://doi.org/10.1007/bf02025532openalex-snapshot
On the use of dense matrix techniques within sparse simplex
inferred← citeshttps://doi.org/10.1007/bf02186471openalex-snapshot
Planning under uncertainty using parallel computing
inferred← citeshttps://doi.org/10.1007/bf02187648openalex-snapshot
Solving linear programs with multiple right-hand sides: Pricing and ordering schemes
inferred← citeshttps://doi.org/10.1007/bfb0006874openalex-snapshot
Algorithms based upon generalized linear programming for stochastic programs with recourse
inferred← citeshttps://doi.org/10.1007/s10589-005-4802-0openalex-snapshot
Hyper-Sparsity in the Revised Simplex Method and How to Exploit it
inferred← citeshttps://doi.org/10.1007/s10589-013-9542-yopenalex-snapshot
Parallel distributed-memory simplex for large-scale stochastic LP problems
inferred← citeshttps://doi.org/10.1007/s10589-014-9689-1openalex-snapshot
Novel update techniques for the revised simplex method
inferred← citeshttps://doi.org/10.1007/s10589-016-9886-1openalex-snapshot
A dual gradient-projection method for large-scale strictly convex quadratic problems
inferred← citeshttps://doi.org/10.1007/s12532-014-0075-xopenalex-snapshot
Methods for convex and general quadratic programming
inferred← citeshttps://doi.org/10.1007/s12532-016-0101-2openalex-snapshot
An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
inferred← citeshttps://doi.org/10.1016/0024-3795(88)90322-9openalex-snapshot
Canonical bases in linear programming
inferred← citeshttps://doi.org/10.1016/0360-8352(90)90006-8openalex-snapshot
Packed data structure and supersparsity savings in a linear programming code
inferred← citeshttps://doi.org/10.1016/0377-2217(84)90228-5openalex-snapshot
Trends in nonlinear programming software
inferred← citeshttps://doi.org/10.1016/0377-2217(88)90193-2openalex-snapshot
Solving many linear programs that differ only in the righthand side
inferred← citeshttps://doi.org/10.1016/j.enganabound.2021.04.009openalex-snapshot
Application of Sherman-Morrison formula in adaptive analysis by BEM
inferred← citeshttps://doi.org/10.1016/s0168-9274(02)00120-4openalex-snapshot
An iterative working-set method for large-scale nonconvex quadratic programming
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/02331939608844246openalex-snapshot
On a distributed implementation of a decomposition method for multistage linear stochastic programs
inferred← citeshttps://doi.org/10.1093/oso/9780198535645.003.0008openalex-snapshot
A Schur-complement method for sparse quadratic programming
inferred← citeshttps://doi.org/10.1109/cdc.1983.269778openalex-snapshot
A basis factorization method for multi-stage linear programming problems with an application to optimal operation of an energy plant
inferred← citeshttps://doi.org/10.1134/s1995423915040011openalex-snapshot
A simplex method algorithm using a double basis
inferred← citeshttps://doi.org/10.1137/0606056openalex-snapshot
Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
inferred← citeshttps://doi.org/10.1137/0613016openalex-snapshot
A Block-$LU$ Update for Large-Scale Linear Programming
inferred← citeshttps://doi.org/10.1137/0905041openalex-snapshot
Sparse Matrix Methods in Optimization
inferred← citeshttps://doi.org/10.1137/16m1082755openalex-snapshot
AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids
inferred← citeshttps://doi.org/10.1145/356022.356025openalex-snapshot
A Reduced Gradient Algorithm for Nonlinear Network Problems
inferred← citeshttps://doi.org/10.1201/9780429333439-17openalex-snapshot
Alternative Methods for Representing the Inverse of Linear Programming Basis Matrices
inferred← citeshttps://doi.org/10.1287/mnsc.34.12.1472openalex-snapshot
Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming
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.