On the public citation graph

A sufficient condition for lower semicontinuity of solution sets of systems of convex inequalities

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.
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-3-0348-6328-5openalex-snapshot
Non-Linear Parametric Optimization
inferredcites →https://doi.org/10.1007/978-3-0348-6328-5_6openalex-snapshot
On Procedures for Analysing Parametric Optimization Problems
inferredcites →https://doi.org/10.1007/bf00932906openalex-snapshot
Calculating the cone of directions of constancy
inferredcites →https://doi.org/10.1007/bf00933129openalex-snapshot
Characterization of optimality in convex programming without a constraint qualification
inferredcites →https://doi.org/10.1007/bf01581627openalex-snapshot
Geometry of optimality conditions and constraint qualifications: The convex case
inferredcites →https://doi.org/10.1007/bfb0120847openalex-snapshot
On the lower semicontinuity of optimal sets in convex parametric optimization
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.1016/b978-0-12-597050-1.50014-2openalex-snapshot
Some Convex Programs Whose Duals Are Linearly Constrained
inferredcites →https://doi.org/10.1080/02331937708842403openalex-snapshot
Stability property of a system of inequalities
inferredcites →https://doi.org/10.1080/02331937708842433openalex-snapshot
Global stability of optimization problems
inferredcites →https://doi.org/10.1080/02331937908842607openalex-snapshot
Über lokale Stabilitätsmengen in der parametrischen quadratischen Optimierung
inferredcites →https://doi.org/10.1137/0308003openalex-snapshot
The Validity of a Family of Optimization Methods
inferredcites →https://doi.org/10.1137/0712056openalex-snapshot
Stability Theory for Systems of Inequalities. Part I: Linear Systems
inferredcites →https://doi.org/10.1137/0713043openalex-snapshot
Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
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

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-1-4615-3600-0_15openalex-snapshot
Topics in Input Optimization
inferred← citeshttps://doi.org/10.1007/bf01423647openalex-snapshot
Stability of efficiency evaluations in data envelopment analysis
inferred← citeshttps://doi.org/10.1007/bf02055196openalex-snapshot
Sensitivity and stability analysis for nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf02109595openalex-snapshot
On a necessary condition for stability in perturbed linear and convex programming
inferred← citeshttps://doi.org/10.1007/bf02207025openalex-snapshot
New results in the theory of multivalued mappings. I. Topological characteristics and solvability of operator relations
inferred← citeshttps://doi.org/10.1007/s00186-014-0465-xopenalex-snapshot
On smoothness properties of optimal value functions at the boundary of their domain under complete convexity
inferred← citeshttps://doi.org/10.1007/s10107-007-0110-zopenalex-snapshot
Some convex programs without a duality gap
inferred← citeshttps://doi.org/10.1007/s11590-014-0738-6openalex-snapshot
Continuity of the solution set mappings to a parametric set optimization problem
inferred← citeshttps://doi.org/10.1080/00036811.2017.1376320openalex-snapshot
Stability of minimal solutions to parametric set optimization problems
inferred← citeshttps://doi.org/10.1080/02331930412331330379openalex-snapshot
On the lower semicontinuity of optimal solution sets
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.1137/120864015openalex-snapshot
Pessimistic Bilevel Optimization
inferred← citeshttps://doi.org/10.21136/am.1988.104325openalex-snapshot
New regions of stability in input optimization
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.