On the public citation graph
Linear-quadratic programming problems with stochastic penalties: The finite generation algorithm
0 signed · 24 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-61370-8_15openalex-snapshot
An Implementation of the Lagrangian Finite-Generation Method
inferredcites →https://doi.org/10.1007/bfb0112539openalex-snapshot
A dual solution procedure for quadratic stochastic programs with simple recourse
inferredcites →https://doi.org/10.1007/bfb0121126openalex-snapshot
A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming
inferredcites →https://doi.org/10.1057/jors.1985.33openalex-snapshot
Network Flows and Monotropic Optimization.
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
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-61370-8_23openalex-snapshot
Lake Eutrophication Management: The Lake Balaton Project
inferred← citeshttps://doi.org/10.1007/978-3-662-12646-2_1openalex-snapshot
Basic Issues in Lagrangian Optimization
inferred← citeshttps://doi.org/10.1007/bf00253806openalex-snapshot
Modified proximal point algorithm for extended linear-quadratic programming
inferred← citeshttps://doi.org/10.1007/s10107-017-1131-xopenalex-snapshot
Quadratic two-stage stochastic optimization with coherent measures of risk
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90377-8openalex-snapshot
The approximation of separable stochastic programs
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90025-6openalex-snapshot
Containing groundwater contamination: Planning models using stochastic programming with recourse
inferred← citeshttps://doi.org/10.1023/a:1018909508556openalex-snapshot
Duality and optimality in multistagestochastic programming
inferred← citeshttps://doi.org/10.1029/92wr00038openalex-snapshot
Groundwater quality management under uncertainty: stochastic programming approaches and the value of information
inferred← citeshttps://doi.org/10.1080/10556789508805619openalex-snapshot
Mcplib: a collection of nonlinear mixed complementarity problems
inferred← citeshttps://doi.org/10.1090/s0002-9947-1988-0936806-9openalex-snapshot
First- and Second-Order Epi-Differentiability in Nonlinear Programming
inferred← citeshttps://doi.org/10.1137/0325045openalex-snapshot
Linear-Quadratic Programming and Optimal Control
inferred← citeshttps://doi.org/10.1137/0328046openalex-snapshot
Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
inferred← citeshttps://doi.org/10.1137/0805006openalex-snapshot
On the Primal-Dual Steepest Descent Algorithm for Extended Linear-Quadratic Programming
inferred← citeshttps://doi.org/10.1137/s0036144595285963openalex-snapshot
Engineering and Economic Applications of Complementarity Problems
inferred← citeshttps://doi.org/10.1137/s0363012992240503openalex-snapshot
Consistency of Primal-Dual Approximations for Convex Optimal Control Problems
inferred← citeshttps://doi.org/10.1137/s0363012994274823openalex-snapshot
Convergence of the BFGS Method for $LC^1 $ Convex Constrained Optimization
inferred← citeshttps://doi.org/10.1287/opre.1080.0659openalex-snapshot
Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse
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.