On the public citation graph

Optimality conditions and constraint qualifications in Banach space

0 signed · 41 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.1002/nav.3800080206openalex-snapshot
Constraint qualifications in maximization problems
inferredcites →https://doi.org/10.1007/978-3-662-25249-9openalex-snapshot
Normed Linear Spaces
inferredcites →https://doi.org/10.1007/978-3-662-41637-2_2openalex-snapshot
Normed Linear Spaces
inferredcites →https://doi.org/10.1007/bf01350314openalex-snapshot
Optimization theory in linear spaces
inferredcites →https://doi.org/10.1007/bf01350322openalex-snapshot
Optimization theory in linear spaces. I
inferredcites →https://doi.org/10.1016/0022-247x(66)90112-0openalex-snapshot
The Kuhn-Tucker conditions in Banach space with an application to control theory
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.1057/jors.1967.61openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1073/pnas.56.4.1066openalex-snapshot
GENERAL NECESSARY CONDITIONS FOR OPTIMIZATION PROBLEMS
inferredcites →https://doi.org/10.1137/0115028openalex-snapshot
Nonlinear Programming in Banach Space
inferredcites →https://doi.org/10.1137/0120021openalex-snapshot
A Necessary and Sufficient Qualification for Constrained Optimization
inferredcites →https://doi.org/10.1137/0304040openalex-snapshot
An Abstract Variational Theory with Applications to a Broad Class of Optimization Problems. I. General Theory
inferredcites →https://doi.org/10.1137/0304041openalex-snapshot
Constrained Minimization Problems in Finite-Dimensional Spaces
inferredcites →https://doi.org/10.1137/0307016openalex-snapshot
Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
inferredcites →https://doi.org/10.2307/1235177openalex-snapshot
Three Essays on the State of Economic Science
inferredcites →https://doi.org/10.2307/1905538openalex-snapshot
Capital Accumulation and Efficient Allocation of Resources
inferredcites →https://doi.org/10.2307/1909111openalex-snapshot
An Infinite-Horizon Discrete-Time Quadratic Program as Applied to a Monopoly Problem
inferredcites →https://doi.org/10.2307/2334042openalex-snapshot
Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability.
inferredcites →https://doi.org/10.2307/2342801openalex-snapshot
Studies in Linear and Non-Linear Programming.
inferredcites →https://doi.org/10.2307/3438846openalex-snapshot
Three Essays on the State of Economic Science

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-0-387-74759-0_458openalex-snapshot
Nonsmooth Analysis: Fréchet Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_458-1openalex-snapshot
Nonsmooth Analysis: Fréchet Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-3-319-23395-6_4openalex-snapshot
Optimization Theory
inferred← citeshttps://doi.org/10.1007/bf00290513openalex-snapshot
A mathematical model of the effects of spatio-temporal patterns of dendritic input potentials on neuronal somatic potentials
inferred← citeshttps://doi.org/10.1007/bf01584534openalex-snapshot
Geometry of optimality conditions and constraint qualifications
inferred← citeshttps://doi.org/10.1007/s10107-023-01942-8openalex-snapshot
First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
inferred← citeshttps://doi.org/10.1007/s10107-025-02237-wopenalex-snapshot
A minimal face constant rank constraint qualification for reducible conic programming
inferred← citeshttps://doi.org/10.1007/s10957-017-1121-4openalex-snapshot
When the Karush–Kuhn–Tucker Theorem Fails: Constraint Qualifications and Higher-Order Optimality Conditions for Degenerate Optimization Problems
inferred← citeshttps://doi.org/10.1016/0022-247x(80)90149-3openalex-snapshot
Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
inferred← citeshttps://doi.org/10.1016/b978-044450550-7/50003-xopenalex-snapshot
Smooth Optimization Problems. Saddle Point Conditions
inferred← citeshttps://doi.org/10.1016/j.na.2011.12.009openalex-snapshot
Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under -invexity
inferred← citeshttps://doi.org/10.1016/j.sysconle.2021.104971openalex-snapshot
Why (some) abnormal problems are “normal”
inferred← citeshttps://doi.org/10.1016/s0168-2024(09)70046-3openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1023/a:1023673105317openalex-snapshot
On Fréchet Subdifferentials
inferred← citeshttps://doi.org/10.1080/02331930903552473openalex-snapshot
An elementary proof of the Karush–Kuhn–Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints
inferred← citeshttps://doi.org/10.1080/02331937808842516openalex-snapshot
Differentiability in optimization theory1
inferred← citeshttps://doi.org/10.1137/19m1306804openalex-snapshot
New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions
inferred← citeshttps://doi.org/10.11606/t.45.2022.tde-30032022-212754openalex-snapshot
Topics in nonlinear conic optimization and applications
inferred← citeshttps://doi.org/10.1287/moor.4.1.79openalex-snapshot
Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
inferred← citeshttps://doi.org/10.24033/msmf.261openalex-snapshot
New concepts in nondifferentiable programming
inferred← citeshttps://doi.org/10.48550/arxiv.2007.12483openalex-snapshot
A simple proof of the Karush-Kuhn-Tucker theorem with finite number of equality and inequality constraints
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.