On the public citation graph
On the lower semicontinuity of optimal sets in convex parametric optimization
0 signed · 31 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.1002/zamm.19760560215openalex-snapshot
F. Nožiêka/J. Guddat/H. Hollatz/B. Bank, Theorie der linearen parametrischen Optimierung. 312 S., Berlin 1974. Akademie‐Verlag. Preis 52,‐ M
inferredcites →https://doi.org/10.1007/bf01580449openalex-snapshot
Optimization algorithms and point-to-set-maps
inferredcites →https://doi.org/10.1016/0022-247x(67)90139-4openalex-snapshot
On the continuity of the minimum set of a continuous function
inferredcites →https://doi.org/10.1016/0022-247x(74)90089-4openalex-snapshot
A sufficient condition for continuity of optimal sets in mathematical programming
inferredcites →https://doi.org/10.1080/02331887608801291openalex-snapshot
Stability in convex quadratic parametric programming
inferredcites →https://doi.org/10.1137/0308003openalex-snapshot
The Validity of a Family of Optimization Methods
inferredcites →https://doi.org/10.1137/1015073openalex-snapshot
Point-to-Set Maps in Mathematical Programming
inferredcites →https://doi.org/10.1287/opre.18.1.107openalex-snapshot
Stability in Nonlinear Programming
inferredcites →https://doi.org/10.1287/opre.20.1.143openalex-snapshot
Extensions of the Evans-Gould Stability Theorems for Mathematical Programs
inferredcites →https://doi.org/10.1515/9783112471548openalex-snapshot
Theorie der linearen parametrischen Optimierung
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-0348-6253-0_10openalex-snapshot
The Historical Development of Parametric Programming
inferred← citeshttps://doi.org/10.1007/bf00047497openalex-snapshot
Characterizing optimality in mathematical programming models
inferred← citeshttps://doi.org/10.1007/bf01184153openalex-snapshot
On a Lagrangian penalty function method for nonlinear programming problems
inferred← citeshttps://doi.org/10.1007/bfb0121039openalex-snapshot
Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients
inferred← citeshttps://doi.org/10.1007/bfb0121210openalex-snapshot
Linear parametric programming—A brief survey
inferred← citeshttps://doi.org/10.1007/bfb0121216openalex-snapshot
A sufficient condition for lower semicontinuity of solution sets of systems of convex inequalities
inferred← citeshttps://doi.org/10.1007/s00186-010-0324-3openalex-snapshot
Global infimum of strictly convex quadratic functions with bounded perturbations
inferred← citeshttps://doi.org/10.1007/s10107-021-01750-yopenalex-snapshot
On implicit function theorem for locally Lipschitz equations
inferred← citeshttps://doi.org/10.1007/s10957-010-9772-4openalex-snapshot
Maximizing Strictly Convex Quadratic Functions with Bounded Perturbations
inferred← citeshttps://doi.org/10.1016/0022-247x(82)90225-6openalex-snapshot
On upper semicontinuity of global minima in constrained optimization problems
inferred← citeshttps://doi.org/10.1016/0362-546x(85)90053-7openalex-snapshot
Perturbed convex programming in reflexive Banach spaces
inferred← citeshttps://doi.org/10.1017/s0334270000006275openalex-snapshot
Constraint qualifications in input optimisation
inferred← citeshttps://doi.org/10.1080/02331931003746114openalex-snapshot
Some properties of boundedly perturbed strictly convex quadratic functions
inferred← citeshttps://doi.org/10.1080/02331937908842607openalex-snapshot
Über lokale Stabilitätsmengen in der parametrischen quadratischen Optimierung
inferred← citeshttps://doi.org/10.1080/02331938708843243openalex-snapshot
Survey of input optimization
inferred← citeshttps://doi.org/10.1080/02331938708843300openalex-snapshot
Existence theorems of equilibrium points in stackelberg
inferred← citeshttps://doi.org/10.1080/02331939108843676openalex-snapshot
The marginal value formula in input optimization
inferred← citeshttps://doi.org/10.1080/10556788.2016.1256400openalex-snapshot
Robust sensitivity analysis of the optimal value of linear programming
inferred← citeshttps://doi.org/10.1090/s0002-9947-01-02664-2openalex-snapshot
Convergence of asymptotic directions
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.