On the public citation graph
A Necessary and Sufficient Condition for a Constrained Minimum
0 signed · 15 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 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-4614-4538-8_1openalex-snapshot
Metric and Topological Tools
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_2openalex-snapshot
Elements of Differential Calculus
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_3openalex-snapshot
Elements of Convex Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_4openalex-snapshot
Elementary and Viscosity Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_5openalex-snapshot
Circa-Subdifferentials, Clarke Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_6openalex-snapshot
Limiting Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_7openalex-snapshot
Graded Subdifferentials, Ioffe Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4757-2600-8_5openalex-snapshot
Quadratic Programming with Box Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4757-3216-0_16openalex-snapshot
Error Bounds for Quadratic Systems
inferred← citeshttps://doi.org/10.1007/bf02592205openalex-snapshot
Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1023/a:1008298700376openalex-snapshot
Computable Error Bounds for Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/s105262349935606xopenalex-snapshot
Approximate Solutions of Analytic Inequality Systems
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.