On the public citation graph
Necessary optimality criteria in mathematical programming in normed linear spaces
0 signed · 30 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/bf00927047openalex-snapshot
A satisfactory treatment of equality and operator constraints in the Dubovitskii-Milyutin optimization formalism
inferredcites →https://doi.org/10.1007/bf00934938openalex-snapshot
On the cones of tangents with applications to mathematical programming
inferredcites →https://doi.org/10.1016/0022-247x(67)90163-1openalex-snapshot
The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
inferredcites →https://doi.org/10.1016/0022-247x(72)90006-6openalex-snapshot
Necessary optimality criteria in mathematical programming in the presence of differentiability
inferredcites →https://doi.org/10.1016/0041-5553(65)90148-5openalex-snapshot
Extremum problems in the presence of restrictions
inferredcites →https://doi.org/10.1016/b978-0-12-597050-1.50015-4openalex-snapshot
Sufficiency Conditions and a Duality Theory for Mathematical Programming Problems in Arbitrary Linear Spaces
inferredcites →https://doi.org/10.1016/s0022-0000(69)80007-3openalex-snapshot
A general theory of extremals
inferredcites →https://doi.org/10.1017/s0004972700046050openalex-snapshot
A generalization of Lagrange multipliers
inferredcites →https://doi.org/10.1049/sqj.1970.0088openalex-snapshot
Optimization by Vector Space Methods
inferredcites →https://doi.org/10.1073/pnas.56.4.1066openalex-snapshot
GENERAL NECESSARY CONDITIONS FOR OPTIMIZATION PROBLEMS
inferredcites →https://doi.org/10.1112/jlms/s1-42.1.523openalex-snapshot
On Differentiation in Normed Vector Spaces
inferredcites →https://doi.org/10.1137/0308039openalex-snapshot
Necessary Conditions for Optimization Problems with Operatorial Constraints
inferredcites →https://doi.org/10.4064/sm-31-4-319-329openalex-snapshot
A general maximum principle for optimization problems
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-07623-9_303openalex-snapshot
Contribution to Dubovitskiy and Milyutin's optimization formalism
inferred← citeshttps://doi.org/10.1007/978-3-642-54265-7_12openalex-snapshot
Optimality Conditions in Set-Valued Optimization
inferred← citeshttps://doi.org/10.1007/bf00933349openalex-snapshot
On the existence and nonexistence of Lagrange multipliers in Banach spaces
inferred← citeshttps://doi.org/10.1007/bf00933918openalex-snapshot
A saddle-point criterion for convex problems with infinite-dimensional equality constraints
inferred← citeshttps://doi.org/10.1007/bf00934658openalex-snapshot
Extremum principles for optimal control in normed linear spaces
inferred← citeshttps://doi.org/10.1007/bf00934910openalex-snapshot
Perturbation theory for abstract optimization problems
inferred← citeshttps://doi.org/10.1007/bf01259338openalex-snapshot
Solvability results for sublinear functions and operators
inferred← citeshttps://doi.org/10.1007/bf01789411openalex-snapshot
Subdifferentials of compactly lipschitzian vector-valued functions
inferred← citeshttps://doi.org/10.1007/bf01917339openalex-snapshot
Approximation operators in optimization theory
inferred← citeshttps://doi.org/10.1016/0022-0531(92)90055-mopenalex-snapshot
Optimal fiscal policy in a stochastic growth model
inferred← citeshttps://doi.org/10.1016/b978-044450550-7/50003-xopenalex-snapshot
Smooth Optimization Problems. Saddle Point Conditions
inferred← citeshttps://doi.org/10.1080/02331937808842516openalex-snapshot
Differentiability in optimization theory1
inferred← citeshttps://doi.org/10.1080/02331938008842628openalex-snapshot
Anmerkungen zu einem abstrakten maximumprinzip von halkin
inferred← citeshttps://doi.org/10.1080/02331938108842716openalex-snapshot
On the existence of minimal lagbange multipliers1
inferred← citeshttps://doi.org/10.1137/0315044openalex-snapshot
Necessary Optimality Conditions with Application to a Variational Problem
inferred← citeshttps://doi.org/10.1287/moor.4.1.79openalex-snapshot
Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
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.