On the public citation graph

Matrix augmentation and structure preservation in linearly constrained control problems

https://doi.org/10.1007/bf01588292
0 signed · 20 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-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/bf01584341openalex-snapshot
Matrix augmentation and partitioning in the updating of the basis inverse
inferredcites →https://doi.org/10.1080/01621459.1938.10502338openalex-snapshot
The Annals of Mathematical Statistics
inferredcites →https://doi.org/10.1145/800184.810500openalex-snapshot
Aspects of large-scale in-core linear programming
inferredcites →https://doi.org/10.2307/3008203openalex-snapshot
Integer and Non-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-12914-6_6openalex-snapshot
Chapter 6 Large sparse quadratic 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-662-21637-8_3openalex-snapshot
Modern Techniques for Linear Dynamic and Stochastic Programs
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/bf00940811openalex-snapshot
The simplex method and unrestricted variables
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/bf01583795openalex-snapshot
Solving staircase linear programs by the simplex method, 1: Inversion
inferred← citeshttps://doi.org/10.1007/bfb0006874openalex-snapshot
Algorithms based upon generalized linear programming for stochastic programs with recourse
inferred← citeshttps://doi.org/10.1016/0377-2217(84)90228-5openalex-snapshot
Trends in nonlinear programming software
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.1287/mnsc.31.6.664openalex-snapshot
A Forward Simplex Method for Staircase Linear Programs
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.